/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_srvr.blast.15.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:45:04,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:45:04,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:45:04,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:45:04,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:45:04,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:45:04,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:45:04,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:45:04,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:45:04,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:45:04,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:45:04,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:45:04,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:45:04,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:45:04,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:45:04,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:45:04,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:45:04,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:45:04,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:45:04,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:45:04,345 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:45:04,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:45:04,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:45:04,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:45:04,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:45:04,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:45:04,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:45:04,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:45:04,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:45:04,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:45:04,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:45:04,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:45:04,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:45:04,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:45:04,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:45:04,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:45:04,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:45:04,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:45:04,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:45:04,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:45:04,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:45:04,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:45:04,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:45:04,382 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:45:04,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:45:04,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:45:04,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:45:04,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:45:04,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:45:04,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:45:04,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:45:04,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:45:04,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:45:04,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:45:04,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:45:04,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:45:04,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:45:04,386 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:45:04,386 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:45:04,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:45:04,386 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:45:04,386 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:45:04,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:45:04,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:45:04,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:45:04,599 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:45:04,599 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:45:04,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-1.c [2022-04-08 08:45:04,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687b952a4/d95da5ef1de243cc975015209fe4aaef/FLAG8467669ba [2022-04-08 08:45:05,070 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:45:05,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-1.c [2022-04-08 08:45:05,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687b952a4/d95da5ef1de243cc975015209fe4aaef/FLAG8467669ba [2022-04-08 08:45:05,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687b952a4/d95da5ef1de243cc975015209fe4aaef [2022-04-08 08:45:05,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:45:05,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:45:05,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:45:05,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:45:05,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:45:05,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725e5998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05, skipping insertion in model container [2022-04-08 08:45:05,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:45:05,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:45:05,475 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_srvr.blast.15.i.cil-1.c[75550,75563] [2022-04-08 08:45:05,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:45:05,497 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:45:05,566 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_srvr.blast.15.i.cil-1.c[75550,75563] [2022-04-08 08:45:05,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:45:05,581 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:45:05,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05 WrapperNode [2022-04-08 08:45:05,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:45:05,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:45:05,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:45:05,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:45:05,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:45:05,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:45:05,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:45:05,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:45:05,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (1/1) ... [2022-04-08 08:45:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:45:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:45:05,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:45:05,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:45:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:45:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:45:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:45:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:45:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:45:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:45:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:45:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:45:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:45:05,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:45:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:45:05,773 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:45:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:45:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:45:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:45:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:45:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:45:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:45:05,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:45:05,970 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:45:05,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:45:06,833 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:45:07,363 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:45:07,363 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:45:07,373 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:45:07,380 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:45:07,380 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:45:07,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:45:07 BoogieIcfgContainer [2022-04-08 08:45:07,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:45:07,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:45:07,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:45:07,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:45:07,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:45:05" (1/3) ... [2022-04-08 08:45:07,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6070d813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:45:07, skipping insertion in model container [2022-04-08 08:45:07,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:05" (2/3) ... [2022-04-08 08:45:07,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6070d813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:45:07, skipping insertion in model container [2022-04-08 08:45:07,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:45:07" (3/3) ... [2022-04-08 08:45:07,387 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2022-04-08 08:45:07,400 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:45:07,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:45:07,436 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:45:07,457 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:45:07,457 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:45:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 154 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:45:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 08:45:07,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:07,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:07,483 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:07,487 INFO L85 PathProgramCache]: Analyzing trace with hash 80900235, now seen corresponding path program 1 times [2022-04-08 08:45:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:07,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927758898] [2022-04-08 08:45:07,499 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:45:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash 80900235, now seen corresponding path program 2 times [2022-04-08 08:45:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:07,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436606577] [2022-04-08 08:45:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:08,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {164#true} is VALID [2022-04-08 08:45:08,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-08 08:45:08,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164#true} {164#true} #703#return; {164#true} is VALID [2022-04-08 08:45:08,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {164#true} call ULTIMATE.init(); {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:08,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {164#true} is VALID [2022-04-08 08:45:08,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-08 08:45:08,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} #703#return; {164#true} is VALID [2022-04-08 08:45:08,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} call #t~ret161 := main(); {164#true} is VALID [2022-04-08 08:45:08,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {164#true} is VALID [2022-04-08 08:45:08,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {164#true} is VALID [2022-04-08 08:45:08,023 INFO L272 TraceCheckUtils]: 7: Hoare triple {164#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {164#true} is VALID [2022-04-08 08:45:08,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:08,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {169#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {170#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:45:08,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {170#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {165#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {165#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {165#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {165#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {165#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {165#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {165#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {165#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {165#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {165#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {165#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {165#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {165#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {165#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {165#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {165#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {165#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {165#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {165#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {165#false} is VALID [2022-04-08 08:45:08,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {165#false} assume 8640 == #t~mem75;havoc #t~mem75; {165#false} is VALID [2022-04-08 08:45:08,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {165#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {165#false} is VALID [2022-04-08 08:45:08,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#false} assume !(4 == ~blastFlag~0); {165#false} is VALID [2022-04-08 08:45:08,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#false} assume !(7 == ~blastFlag~0); {165#false} is VALID [2022-04-08 08:45:08,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#false} assume !(10 == ~blastFlag~0); {165#false} is VALID [2022-04-08 08:45:08,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-04-08 08:45:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:08,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:08,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436606577] [2022-04-08 08:45:08,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436606577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:08,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:08,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:08,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927758898] [2022-04-08 08:45:08,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927758898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:08,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:08,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379893879] [2022-04-08 08:45:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 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 50 [2022-04-08 08:45:08,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:08,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:08,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:08,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:08,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:08,142 INFO L87 Difference]: Start difference. First operand has 161 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 154 states have internal predecessors, (262), 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 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:11,789 INFO L93 Difference]: Finished difference Result 340 states and 572 transitions. [2022-04-08 08:45:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:11,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 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 50 [2022-04-08 08:45:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 08:45:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 08:45:11,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-08 08:45:12,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:12,205 INFO L225 Difference]: With dead ends: 340 [2022-04-08 08:45:12,205 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 08:45:12,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:12,210 INFO L913 BasicCegarLoop]: 235 mSDtfsCounter, 34 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:12,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 625 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 08:45:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 08:45:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2022-04-08 08:45:12,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:12,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:12,240 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:12,241 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:12,246 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2022-04-08 08:45:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2022-04-08 08:45:12,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:12,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:12,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 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 173 states. [2022-04-08 08:45:12,249 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 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 173 states. [2022-04-08 08:45:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:12,254 INFO L93 Difference]: Finished difference Result 173 states and 261 transitions. [2022-04-08 08:45:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2022-04-08 08:45:12,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:12,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:12,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:12,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 151 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 240 transitions. [2022-04-08 08:45:12,261 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 240 transitions. Word has length 50 [2022-04-08 08:45:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:12,261 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 240 transitions. [2022-04-08 08:45:12,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:12,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 240 transitions. [2022-04-08 08:45:12,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 240 transitions. [2022-04-08 08:45:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:45:12,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:12,426 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:12,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:45:12,426 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:12,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -450854301, now seen corresponding path program 1 times [2022-04-08 08:45:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:12,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759548812] [2022-04-08 08:45:12,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:12,452 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:12,452 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash -450854301, now seen corresponding path program 2 times [2022-04-08 08:45:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:12,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701192101] [2022-04-08 08:45:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:12,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:12,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1514#true} is VALID [2022-04-08 08:45:12,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-08 08:45:12,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1514#true} {1514#true} #703#return; {1514#true} is VALID [2022-04-08 08:45:12,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1521#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:12,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1514#true} is VALID [2022-04-08 08:45:12,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-08 08:45:12,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #703#return; {1514#true} is VALID [2022-04-08 08:45:12,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret161 := main(); {1514#true} is VALID [2022-04-08 08:45:12,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1514#true} is VALID [2022-04-08 08:45:12,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {1514#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1514#true} is VALID [2022-04-08 08:45:12,616 INFO L272 TraceCheckUtils]: 7: Hoare triple {1514#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1514#true} is VALID [2022-04-08 08:45:12,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:12,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {1519#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1520#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 08:45:12,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {1520#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1515#false} is VALID [2022-04-08 08:45:12,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {1515#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {1515#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {1515#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {1515#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {1515#false} ~skip~0 := 0; {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {1515#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {1515#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {1515#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {1515#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {1515#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {1515#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {1515#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {1515#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {1515#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {1515#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {1515#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {1515#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {1515#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {1515#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {1515#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {1515#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {1515#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {1515#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {1515#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {1515#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {1515#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {1515#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {1515#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {1515#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 52: Hoare triple {1515#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 53: Hoare triple {1515#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {1515#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {1515#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {1515#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {1515#false} assume 8640 == #t~mem75;havoc #t~mem75; {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {1515#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 59: Hoare triple {1515#false} assume !(4 == ~blastFlag~0); {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {1515#false} assume !(7 == ~blastFlag~0); {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {1515#false} assume !(10 == ~blastFlag~0); {1515#false} is VALID [2022-04-08 08:45:12,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-08 08:45:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:12,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701192101] [2022-04-08 08:45:12,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701192101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:12,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:12,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759548812] [2022-04-08 08:45:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759548812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:12,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835934402] [2022-04-08 08:45:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:12,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 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 63 [2022-04-08 08:45:12,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:12,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:12,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:12,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:12,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:12,684 INFO L87 Difference]: Start difference. First operand 156 states and 240 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:18,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:20,990 INFO L93 Difference]: Finished difference Result 405 states and 628 transitions. [2022-04-08 08:45:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 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 63 [2022-04-08 08:45:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-08 08:45:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-08 08:45:21,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-08 08:45:21,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:21,400 INFO L225 Difference]: With dead ends: 405 [2022-04-08 08:45:21,400 INFO L226 Difference]: Without dead ends: 275 [2022-04-08 08:45:21,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:21,401 INFO L913 BasicCegarLoop]: 269 mSDtfsCounter, 147 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:21,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 652 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:45:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-08 08:45:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2022-04-08 08:45:21,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:21,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 172 states, 167 states have (on average 1.562874251497006) internal successors, (261), 167 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,412 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 172 states, 167 states have (on average 1.562874251497006) internal successors, (261), 167 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,413 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 172 states, 167 states have (on average 1.562874251497006) internal successors, (261), 167 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:21,426 INFO L93 Difference]: Finished difference Result 275 states and 424 transitions. [2022-04-08 08:45:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 424 transitions. [2022-04-08 08:45:21,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:21,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:21,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.562874251497006) internal successors, (261), 167 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-08 08:45:21,429 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.562874251497006) internal successors, (261), 167 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-08 08:45:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:21,443 INFO L93 Difference]: Finished difference Result 275 states and 424 transitions. [2022-04-08 08:45:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 424 transitions. [2022-04-08 08:45:21,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:21,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:21,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:21,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.562874251497006) internal successors, (261), 167 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2022-04-08 08:45:21,449 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 63 [2022-04-08 08:45:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:21,450 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2022-04-08 08:45:21,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 265 transitions. [2022-04-08 08:45:21,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2022-04-08 08:45:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:21,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:21,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:21,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:45:21,610 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1137075757, now seen corresponding path program 1 times [2022-04-08 08:45:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:21,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748207483] [2022-04-08 08:45:21,641 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:21,641 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:21,641 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1137075757, now seen corresponding path program 2 times [2022-04-08 08:45:21,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:21,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090250617] [2022-04-08 08:45:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:21,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {3237#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3230#true} is VALID [2022-04-08 08:45:21,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {3230#true} assume true; {3230#true} is VALID [2022-04-08 08:45:21,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3230#true} {3230#true} #703#return; {3230#true} is VALID [2022-04-08 08:45:21,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {3230#true} call ULTIMATE.init(); {3237#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:21,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3230#true} is VALID [2022-04-08 08:45:21,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {3230#true} assume true; {3230#true} is VALID [2022-04-08 08:45:21,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3230#true} {3230#true} #703#return; {3230#true} is VALID [2022-04-08 08:45:21,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {3230#true} call #t~ret161 := main(); {3230#true} is VALID [2022-04-08 08:45:21,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {3230#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3230#true} is VALID [2022-04-08 08:45:21,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {3230#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3230#true} is VALID [2022-04-08 08:45:21,819 INFO L272 TraceCheckUtils]: 7: Hoare triple {3230#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3230#true} is VALID [2022-04-08 08:45:21,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {3230#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:21,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:21,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:21,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:21,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:21,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:21,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:21,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {3235#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3236#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:45:21,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {3236#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {3231#false} is VALID [2022-04-08 08:45:21,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {3231#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {3231#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {3231#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3231#false} is VALID [2022-04-08 08:45:21,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {3231#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {3231#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {3231#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3231#false} is VALID [2022-04-08 08:45:21,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {3231#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {3231#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {3231#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {3231#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3231#false} is VALID [2022-04-08 08:45:21,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {3231#false} ~skip~0 := 0; {3231#false} is VALID [2022-04-08 08:45:21,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {3231#false} assume !false; {3231#false} is VALID [2022-04-08 08:45:21,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {3231#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {3231#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {3231#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {3231#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {3231#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {3231#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {3231#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {3231#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {3231#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {3231#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {3231#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {3231#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {3231#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {3231#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {3231#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {3231#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {3231#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {3231#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {3231#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {3231#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {3231#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {3231#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {3231#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 52: Hoare triple {3231#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {3231#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {3231#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {3231#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 56: Hoare triple {3231#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {3231#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {3231#false} assume 8640 == #t~mem75;havoc #t~mem75; {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {3231#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 60: Hoare triple {3231#false} assume !(4 == ~blastFlag~0); {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 61: Hoare triple {3231#false} assume !(7 == ~blastFlag~0); {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {3231#false} assume !(10 == ~blastFlag~0); {3231#false} is VALID [2022-04-08 08:45:21,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {3231#false} assume !false; {3231#false} is VALID [2022-04-08 08:45:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:21,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090250617] [2022-04-08 08:45:21,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090250617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:21,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:21,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:21,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:21,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748207483] [2022-04-08 08:45:21,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748207483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:21,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:21,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677586246] [2022-04-08 08:45:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:21,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:45:21,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:21,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:21,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:21,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:21,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:21,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:21,875 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:28,473 INFO L93 Difference]: Finished difference Result 334 states and 513 transitions. [2022-04-08 08:45:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:45:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:45:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:45:28,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 08:45:28,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:28,756 INFO L225 Difference]: With dead ends: 334 [2022-04-08 08:45:28,756 INFO L226 Difference]: Without dead ends: 188 [2022-04-08 08:45:28,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:28,757 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 28 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:28,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 503 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:45:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-08 08:45:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2022-04-08 08:45:28,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:28,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 172 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 167 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,767 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 172 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 167 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,767 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 172 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 167 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:28,771 INFO L93 Difference]: Finished difference Result 188 states and 284 transitions. [2022-04-08 08:45:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 284 transitions. [2022-04-08 08:45:28,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:28,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:28,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 167 states have internal predecessors, (260), 3 states have call successors, (3), 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 188 states. [2022-04-08 08:45:28,772 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 167 states have internal predecessors, (260), 3 states have call successors, (3), 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 188 states. [2022-04-08 08:45:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:28,776 INFO L93 Difference]: Finished difference Result 188 states and 284 transitions. [2022-04-08 08:45:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 284 transitions. [2022-04-08 08:45:28,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:28,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:28,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:28,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 167 states have internal predecessors, (260), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2022-04-08 08:45:28,807 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 64 [2022-04-08 08:45:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:28,808 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2022-04-08 08:45:28,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 264 transitions. [2022-04-08 08:45:28,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2022-04-08 08:45:28,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:28,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:28,982 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:28,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:45:28,982 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash 749827687, now seen corresponding path program 1 times [2022-04-08 08:45:28,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:28,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039624093] [2022-04-08 08:45:29,123 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:29,123 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2127483762, now seen corresponding path program 1 times [2022-04-08 08:45:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:29,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135389980] [2022-04-08 08:45:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:29,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {4639#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4630#true} is VALID [2022-04-08 08:45:29,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {4630#true} assume true; {4630#true} is VALID [2022-04-08 08:45:29,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4630#true} {4630#true} #703#return; {4630#true} is VALID [2022-04-08 08:45:29,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {4630#true} call ULTIMATE.init(); {4639#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:29,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {4639#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4630#true} is VALID [2022-04-08 08:45:29,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {4630#true} assume true; {4630#true} is VALID [2022-04-08 08:45:29,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4630#true} {4630#true} #703#return; {4630#true} is VALID [2022-04-08 08:45:29,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {4630#true} call #t~ret161 := main(); {4630#true} is VALID [2022-04-08 08:45:29,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {4630#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4630#true} is VALID [2022-04-08 08:45:29,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {4630#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4635#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-08 08:45:29,476 INFO L272 TraceCheckUtils]: 7: Hoare triple {4635#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4636#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-08 08:45:29,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {4636#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {4637#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4638#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 08:45:29,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4631#false} is VALID [2022-04-08 08:45:29,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {4631#false} [709] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {4631#false} is VALID [2022-04-08 08:45:29,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {4631#false} [708] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4631#false} is VALID [2022-04-08 08:45:29,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {4631#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {4631#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {4631#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {4631#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {4631#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {4631#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {4631#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {4631#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {4631#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {4631#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {4631#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {4631#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {4631#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {4631#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {4631#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {4631#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {4631#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {4631#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {4631#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {4631#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {4631#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {4631#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {4631#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {4631#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {4631#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {4631#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {4631#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {4631#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {4631#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {4631#false} assume 8640 == #t~mem75;havoc #t~mem75; {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {4631#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {4631#false} assume !(4 == ~blastFlag~0); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {4631#false} assume !(7 == ~blastFlag~0); {4631#false} is VALID [2022-04-08 08:45:29,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {4631#false} assume !(10 == ~blastFlag~0); {4631#false} is VALID [2022-04-08 08:45:29,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {4631#false} assume !false; {4631#false} is VALID [2022-04-08 08:45:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:29,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135389980] [2022-04-08 08:45:29,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135389980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:29,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:29,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:45:29,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:29,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039624093] [2022-04-08 08:45:29,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039624093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:29,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:29,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:45:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144776631] [2022-04-08 08:45:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:29,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 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 64 [2022-04-08 08:45:29,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:29,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:29,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:45:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:29,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:45:29,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:45:29,537 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:31,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:33,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:37,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:40,542 INFO L93 Difference]: Finished difference Result 337 states and 520 transitions. [2022-04-08 08:45:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:45:40,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 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 64 [2022-04-08 08:45:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 434 transitions. [2022-04-08 08:45:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 434 transitions. [2022-04-08 08:45:40,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 434 transitions. [2022-04-08 08:45:40,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:40,825 INFO L225 Difference]: With dead ends: 337 [2022-04-08 08:45:40,825 INFO L226 Difference]: Without dead ends: 172 [2022-04-08 08:45:40,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:45:40,826 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 7 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:40,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 871 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 450 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-08 08:45:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-08 08:45:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-04-08 08:45:40,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:40,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 172 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,833 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 172 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,833 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 172 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:40,836 INFO L93 Difference]: Finished difference Result 172 states and 263 transitions. [2022-04-08 08:45:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2022-04-08 08:45:40,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:40,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:40,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 3 states have call successors, (3), 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 172 states. [2022-04-08 08:45:40,837 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 3 states have call successors, (3), 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 172 states. [2022-04-08 08:45:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:40,840 INFO L93 Difference]: Finished difference Result 172 states and 263 transitions. [2022-04-08 08:45:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2022-04-08 08:45:40,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:40,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:40,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:40,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 263 transitions. [2022-04-08 08:45:40,844 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 263 transitions. Word has length 64 [2022-04-08 08:45:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:40,844 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 263 transitions. [2022-04-08 08:45:40,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 263 transitions. [2022-04-08 08:45:41,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2022-04-08 08:45:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:41,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:41,020 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:41,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:45:41,020 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1183556773, now seen corresponding path program 1 times [2022-04-08 08:45:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:41,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703347364] [2022-04-08 08:45:41,170 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:41,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -968832688, now seen corresponding path program 1 times [2022-04-08 08:45:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:41,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955572771] [2022-04-08 08:45:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:45:41,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:45:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:45:41,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:45:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1183556773, now seen corresponding path program 2 times [2022-04-08 08:45:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:41,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040042] [2022-04-08 08:45:41,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:41,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {6017#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6010#true} is VALID [2022-04-08 08:45:41,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {6010#true} assume true; {6010#true} is VALID [2022-04-08 08:45:41,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6010#true} {6010#true} #703#return; {6010#true} is VALID [2022-04-08 08:45:41,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {6010#true} call ULTIMATE.init(); {6017#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:41,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {6017#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6010#true} is VALID [2022-04-08 08:45:41,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {6010#true} assume true; {6010#true} is VALID [2022-04-08 08:45:41,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6010#true} {6010#true} #703#return; {6010#true} is VALID [2022-04-08 08:45:41,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {6010#true} call #t~ret161 := main(); {6010#true} is VALID [2022-04-08 08:45:41,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {6010#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6010#true} is VALID [2022-04-08 08:45:41,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {6010#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {6010#true} is VALID [2022-04-08 08:45:41,732 INFO L272 TraceCheckUtils]: 7: Hoare triple {6010#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6010#true} is VALID [2022-04-08 08:45:41,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {6010#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:41,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {6015#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6016#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 08:45:41,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {6016#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {6011#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {6011#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {6011#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {6011#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {6011#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {6011#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {6011#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {6011#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {6011#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {6011#false} ~skip~0 := 0; {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {6011#false} assume !false; {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {6011#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {6011#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {6011#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {6011#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {6011#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {6011#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {6011#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {6011#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {6011#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {6011#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {6011#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {6011#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {6011#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {6011#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {6011#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {6011#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {6011#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 46: Hoare triple {6011#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {6011#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {6011#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {6011#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {6011#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {6011#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {6011#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {6011#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {6011#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {6011#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {6011#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {6011#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {6011#false} assume 8640 == #t~mem75;havoc #t~mem75; {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {6011#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {6011#false} assume !(4 == ~blastFlag~0); {6011#false} is VALID [2022-04-08 08:45:41,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {6011#false} assume !(7 == ~blastFlag~0); {6011#false} is VALID [2022-04-08 08:45:41,745 INFO L290 TraceCheckUtils]: 62: Hoare triple {6011#false} assume !(10 == ~blastFlag~0); {6011#false} is VALID [2022-04-08 08:45:41,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {6011#false} assume !false; {6011#false} is VALID [2022-04-08 08:45:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040042] [2022-04-08 08:45:41,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:41,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:41,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:41,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:41,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703347364] [2022-04-08 08:45:41,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703347364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:41,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:41,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118912495] [2022-04-08 08:45:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:41,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:45:41,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:41,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:41,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:41,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:41,791 INFO L87 Difference]: Start difference. First operand 172 states and 263 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:44,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:49,983 INFO L93 Difference]: Finished difference Result 437 states and 677 transitions. [2022-04-08 08:45:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:45:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:45:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:45:50,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-08 08:45:50,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:50,378 INFO L225 Difference]: With dead ends: 437 [2022-04-08 08:45:50,378 INFO L226 Difference]: Without dead ends: 291 [2022-04-08 08:45:50,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:50,379 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 151 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:50,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 358 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 480 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:45:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-08 08:45:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2022-04-08 08:45:50,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:50,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 184 states, 179 states have (on average 1.5363128491620113) internal successors, (275), 179 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:50,387 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 184 states, 179 states have (on average 1.5363128491620113) internal successors, (275), 179 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:50,387 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 184 states, 179 states have (on average 1.5363128491620113) internal successors, (275), 179 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:50,392 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2022-04-08 08:45:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 446 transitions. [2022-04-08 08:45:50,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:50,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:50,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 179 states have (on average 1.5363128491620113) internal successors, (275), 179 states have internal predecessors, (275), 3 states have call successors, (3), 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 291 states. [2022-04-08 08:45:50,393 INFO L87 Difference]: Start difference. First operand has 184 states, 179 states have (on average 1.5363128491620113) internal successors, (275), 179 states have internal predecessors, (275), 3 states have call successors, (3), 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 291 states. [2022-04-08 08:45:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:50,398 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2022-04-08 08:45:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 446 transitions. [2022-04-08 08:45:50,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:50,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:50,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:50,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.5363128491620113) internal successors, (275), 179 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 279 transitions. [2022-04-08 08:45:50,402 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 279 transitions. Word has length 64 [2022-04-08 08:45:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:50,402 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 279 transitions. [2022-04-08 08:45:50,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:50,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 279 transitions. [2022-04-08 08:45:50,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 279 transitions. [2022-04-08 08:45:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:50,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:50,606 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:50,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5 [2022-04-08 08:45:50,606 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1996403684, now seen corresponding path program 1 times [2022-04-08 08:45:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:50,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635645367] [2022-04-08 08:45:50,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:50,622 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:50,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1996403684, now seen corresponding path program 2 times [2022-04-08 08:45:50,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:50,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337086867] [2022-04-08 08:45:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:50,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {7853#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7846#true} is VALID [2022-04-08 08:45:50,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {7846#true} assume true; {7846#true} is VALID [2022-04-08 08:45:50,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7846#true} {7846#true} #703#return; {7846#true} is VALID [2022-04-08 08:45:50,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {7846#true} call ULTIMATE.init(); {7853#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:50,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {7853#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7846#true} is VALID [2022-04-08 08:45:50,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {7846#true} assume true; {7846#true} is VALID [2022-04-08 08:45:50,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7846#true} {7846#true} #703#return; {7846#true} is VALID [2022-04-08 08:45:50,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {7846#true} call #t~ret161 := main(); {7846#true} is VALID [2022-04-08 08:45:50,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {7846#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7846#true} is VALID [2022-04-08 08:45:50,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {7846#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {7846#true} is VALID [2022-04-08 08:45:50,731 INFO L272 TraceCheckUtils]: 7: Hoare triple {7846#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7846#true} is VALID [2022-04-08 08:45:50,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {7846#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:45:50,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {7851#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7852#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:45:50,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {7852#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {7847#false} is VALID [2022-04-08 08:45:50,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {7847#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7847#false} is VALID [2022-04-08 08:45:50,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {7847#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {7847#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {7847#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7847#false} is VALID [2022-04-08 08:45:50,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {7847#false} ~skip~0 := 0; {7847#false} is VALID [2022-04-08 08:45:50,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {7847#false} assume !false; {7847#false} is VALID [2022-04-08 08:45:50,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {7847#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {7847#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {7847#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {7847#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {7847#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {7847#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {7847#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {7847#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {7847#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {7847#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {7847#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {7847#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {7847#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {7847#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {7847#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {7847#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {7847#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {7847#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {7847#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {7847#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {7847#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {7847#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {7847#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {7847#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {7847#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {7847#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {7847#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {7847#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {7847#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7847#false} is VALID [2022-04-08 08:45:50,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {7847#false} assume 8640 == #t~mem75;havoc #t~mem75; {7847#false} is VALID [2022-04-08 08:45:50,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {7847#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7847#false} is VALID [2022-04-08 08:45:50,746 INFO L290 TraceCheckUtils]: 60: Hoare triple {7847#false} assume !(4 == ~blastFlag~0); {7847#false} is VALID [2022-04-08 08:45:50,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {7847#false} assume !(7 == ~blastFlag~0); {7847#false} is VALID [2022-04-08 08:45:50,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {7847#false} assume !(10 == ~blastFlag~0); {7847#false} is VALID [2022-04-08 08:45:50,748 INFO L290 TraceCheckUtils]: 63: Hoare triple {7847#false} assume !false; {7847#false} is VALID [2022-04-08 08:45:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:50,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337086867] [2022-04-08 08:45:50,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337086867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:50,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:50,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:50,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635645367] [2022-04-08 08:45:50,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635645367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:50,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:50,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617167919] [2022-04-08 08:45:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:50,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:45:50,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:50,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:50,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:50,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:50,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:50,794 INFO L87 Difference]: Start difference. First operand 184 states and 279 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:54,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:01,355 INFO L93 Difference]: Finished difference Result 449 states and 691 transitions. [2022-04-08 08:46:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:01,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:46:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:46:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:46:01,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-08 08:46:01,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:01,760 INFO L225 Difference]: With dead ends: 449 [2022-04-08 08:46:01,760 INFO L226 Difference]: Without dead ends: 291 [2022-04-08 08:46:01,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:01,761 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 145 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:01,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 358 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 08:46:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-08 08:46:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 189. [2022-04-08 08:46:01,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:01,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 189 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 184 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,780 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 189 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 184 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,780 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 189 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 184 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:01,785 INFO L93 Difference]: Finished difference Result 291 states and 444 transitions. [2022-04-08 08:46:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 444 transitions. [2022-04-08 08:46:01,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:01,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:01,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 184 states have internal predecessors, (283), 3 states have call successors, (3), 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 291 states. [2022-04-08 08:46:01,786 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 184 states have internal predecessors, (283), 3 states have call successors, (3), 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 291 states. [2022-04-08 08:46:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:01,791 INFO L93 Difference]: Finished difference Result 291 states and 444 transitions. [2022-04-08 08:46:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 444 transitions. [2022-04-08 08:46:01,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:01,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:01,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:01,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 184 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 287 transitions. [2022-04-08 08:46:01,812 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 287 transitions. Word has length 64 [2022-04-08 08:46:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:01,812 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 287 transitions. [2022-04-08 08:46:01,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 287 transitions. [2022-04-08 08:46:02,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 287 transitions. [2022-04-08 08:46:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:46:02,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:02,025 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:02,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:46:02,026 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1928843683, now seen corresponding path program 1 times [2022-04-08 08:46:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:02,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193204129] [2022-04-08 08:46:02,039 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:02,039 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:02,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1928843683, now seen corresponding path program 2 times [2022-04-08 08:46:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:02,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532563487] [2022-04-08 08:46:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:02,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {9723#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9716#true} is VALID [2022-04-08 08:46:02,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {9716#true} assume true; {9716#true} is VALID [2022-04-08 08:46:02,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9716#true} {9716#true} #703#return; {9716#true} is VALID [2022-04-08 08:46:02,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {9716#true} call ULTIMATE.init(); {9723#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:02,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {9723#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9716#true} is VALID [2022-04-08 08:46:02,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {9716#true} assume true; {9716#true} is VALID [2022-04-08 08:46:02,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9716#true} {9716#true} #703#return; {9716#true} is VALID [2022-04-08 08:46:02,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {9716#true} call #t~ret161 := main(); {9716#true} is VALID [2022-04-08 08:46:02,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {9716#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9716#true} is VALID [2022-04-08 08:46:02,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {9716#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {9716#true} is VALID [2022-04-08 08:46:02,141 INFO L272 TraceCheckUtils]: 7: Hoare triple {9716#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9716#true} is VALID [2022-04-08 08:46:02,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {9716#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9722#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {9722#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {9717#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {9717#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {9717#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {9717#false} ~skip~0 := 0; {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {9717#false} assume !false; {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {9717#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {9717#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {9717#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {9717#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {9717#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {9717#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {9717#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {9717#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {9717#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {9717#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {9717#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {9717#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {9717#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {9717#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {9717#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {9717#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {9717#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {9717#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 47: Hoare triple {9717#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {9717#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {9717#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {9717#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {9717#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {9717#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {9717#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {9717#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {9717#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {9717#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {9717#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {9717#false} assume 8640 == #t~mem75;havoc #t~mem75; {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {9717#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {9717#false} assume !(4 == ~blastFlag~0); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {9717#false} assume !(7 == ~blastFlag~0); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {9717#false} assume !(10 == ~blastFlag~0); {9717#false} is VALID [2022-04-08 08:46:02,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {9717#false} assume !false; {9717#false} is VALID [2022-04-08 08:46:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:02,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:02,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532563487] [2022-04-08 08:46:02,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532563487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:02,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:02,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:02,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:02,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193204129] [2022-04-08 08:46:02,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193204129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:02,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:02,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419220916] [2022-04-08 08:46:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:02,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:46:02,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:02,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:02,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:02,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:02,201 INFO L87 Difference]: Start difference. First operand 189 states and 287 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:05,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:07,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:09,101 INFO L93 Difference]: Finished difference Result 453 states and 697 transitions. [2022-04-08 08:46:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-08 08:46:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-08 08:46:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-08 08:46:09,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 605 transitions. [2022-04-08 08:46:09,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:09,506 INFO L225 Difference]: With dead ends: 453 [2022-04-08 08:46:09,506 INFO L226 Difference]: Without dead ends: 290 [2022-04-08 08:46:09,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:09,507 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 143 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:09,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 360 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 08:46:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-04-08 08:46:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 190. [2022-04-08 08:46:09,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:09,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand has 190 states, 185 states have (on average 1.5297297297297296) internal successors, (283), 185 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,514 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand has 190 states, 185 states have (on average 1.5297297297297296) internal successors, (283), 185 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,515 INFO L87 Difference]: Start difference. First operand 290 states. Second operand has 190 states, 185 states have (on average 1.5297297297297296) internal successors, (283), 185 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:09,522 INFO L93 Difference]: Finished difference Result 290 states and 441 transitions. [2022-04-08 08:46:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 441 transitions. [2022-04-08 08:46:09,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:09,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:09,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.5297297297297296) internal successors, (283), 185 states have internal predecessors, (283), 3 states have call successors, (3), 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 290 states. [2022-04-08 08:46:09,524 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.5297297297297296) internal successors, (283), 185 states have internal predecessors, (283), 3 states have call successors, (3), 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 290 states. [2022-04-08 08:46:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:09,529 INFO L93 Difference]: Finished difference Result 290 states and 441 transitions. [2022-04-08 08:46:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 441 transitions. [2022-04-08 08:46:09,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:09,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:09,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:09,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.5297297297297296) internal successors, (283), 185 states have internal predecessors, (283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 287 transitions. [2022-04-08 08:46:09,535 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 287 transitions. Word has length 64 [2022-04-08 08:46:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:09,535 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 287 transitions. [2022-04-08 08:46:09,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 287 transitions. [2022-04-08 08:46:09,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 287 transitions. [2022-04-08 08:46:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:46:09,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:09,720 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:09,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:46:09,720 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash 394992270, now seen corresponding path program 1 times [2022-04-08 08:46:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [22653351] [2022-04-08 08:46:09,842 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:09,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash -703667952, now seen corresponding path program 1 times [2022-04-08 08:46:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:09,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878796022] [2022-04-08 08:46:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:09,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:46:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:10,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:46:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash 394992270, now seen corresponding path program 2 times [2022-04-08 08:46:10,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:10,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432255864] [2022-04-08 08:46:10,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:10,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:10,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:10,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {11601#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11594#true} is VALID [2022-04-08 08:46:10,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {11594#true} assume true; {11594#true} is VALID [2022-04-08 08:46:10,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11594#true} {11594#true} #703#return; {11594#true} is VALID [2022-04-08 08:46:10,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {11594#true} call ULTIMATE.init(); {11601#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:10,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {11601#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {11594#true} is VALID [2022-04-08 08:46:10,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {11594#true} assume true; {11594#true} is VALID [2022-04-08 08:46:10,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11594#true} {11594#true} #703#return; {11594#true} is VALID [2022-04-08 08:46:10,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {11594#true} call #t~ret161 := main(); {11594#true} is VALID [2022-04-08 08:46:10,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {11594#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11594#true} is VALID [2022-04-08 08:46:10,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {11594#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {11594#true} is VALID [2022-04-08 08:46:10,186 INFO L272 TraceCheckUtils]: 7: Hoare triple {11594#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11594#true} is VALID [2022-04-08 08:46:10,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {11594#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:10,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {11599#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11600#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 08:46:10,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {11600#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {11595#false} is VALID [2022-04-08 08:46:10,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {11595#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {11595#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11595#false} is VALID [2022-04-08 08:46:10,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {11595#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {11595#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {11595#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {11595#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {11595#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {11595#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {11595#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {11595#false} ~skip~0 := 0; {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {11595#false} assume !false; {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {11595#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {11595#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {11595#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {11595#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {11595#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {11595#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {11595#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {11595#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {11595#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {11595#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {11595#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {11595#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {11595#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {11595#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {11595#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {11595#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {11595#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {11595#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {11595#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {11595#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {11595#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {11595#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {11595#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {11595#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {11595#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {11595#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {11595#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {11595#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {11595#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {11595#false} assume 8640 == #t~mem75;havoc #t~mem75; {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {11595#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {11595#false} assume !(4 == ~blastFlag~0); {11595#false} is VALID [2022-04-08 08:46:10,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {11595#false} assume !(7 == ~blastFlag~0); {11595#false} is VALID [2022-04-08 08:46:10,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {11595#false} assume !(10 == ~blastFlag~0); {11595#false} is VALID [2022-04-08 08:46:10,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {11595#false} assume !false; {11595#false} is VALID [2022-04-08 08:46:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:10,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:10,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432255864] [2022-04-08 08:46:10,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432255864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:10,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:10,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:10,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:10,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [22653351] [2022-04-08 08:46:10,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [22653351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:10,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:10,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:10,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934433300] [2022-04-08 08:46:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:46:10,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:10,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:10,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:10,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:10,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:10,245 INFO L87 Difference]: Start difference. First operand 190 states and 287 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:12,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:16,775 INFO L93 Difference]: Finished difference Result 367 states and 559 transitions. [2022-04-08 08:46:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:46:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-08 08:46:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-08 08:46:16,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-08 08:46:17,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:17,093 INFO L225 Difference]: With dead ends: 367 [2022-04-08 08:46:17,093 INFO L226 Difference]: Without dead ends: 203 [2022-04-08 08:46:17,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:17,094 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 22 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:17,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 507 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:46:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-08 08:46:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 190. [2022-04-08 08:46:17,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:17,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.5243243243243243) internal successors, (282), 185 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,100 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.5243243243243243) internal successors, (282), 185 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,101 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.5243243243243243) internal successors, (282), 185 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:17,104 INFO L93 Difference]: Finished difference Result 203 states and 303 transitions. [2022-04-08 08:46:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 303 transitions. [2022-04-08 08:46:17,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:17,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:17,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.5243243243243243) internal successors, (282), 185 states have internal predecessors, (282), 3 states have call successors, (3), 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 203 states. [2022-04-08 08:46:17,105 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.5243243243243243) internal successors, (282), 185 states have internal predecessors, (282), 3 states have call successors, (3), 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 203 states. [2022-04-08 08:46:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:17,108 INFO L93 Difference]: Finished difference Result 203 states and 303 transitions. [2022-04-08 08:46:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 303 transitions. [2022-04-08 08:46:17,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:17,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:17,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:17,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.5243243243243243) internal successors, (282), 185 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 286 transitions. [2022-04-08 08:46:17,113 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 286 transitions. Word has length 65 [2022-04-08 08:46:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:17,113 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 286 transitions. [2022-04-08 08:46:17,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 286 transitions. [2022-04-08 08:46:17,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 286 transitions. [2022-04-08 08:46:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:46:17,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:17,322 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:17,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9 [2022-04-08 08:46:17,322 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1310908150, now seen corresponding path program 1 times [2022-04-08 08:46:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:17,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1311794502] [2022-04-08 08:46:17,457 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:17,458 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -438503216, now seen corresponding path program 1 times [2022-04-08 08:46:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:17,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161545677] [2022-04-08 08:46:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:17,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:46:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:17,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:46:17,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1310908150, now seen corresponding path program 2 times [2022-04-08 08:46:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:17,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296021007] [2022-04-08 08:46:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:17,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:17,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {13133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13126#true} is VALID [2022-04-08 08:46:17,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {13126#true} assume true; {13126#true} is VALID [2022-04-08 08:46:17,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13126#true} {13126#true} #703#return; {13126#true} is VALID [2022-04-08 08:46:17,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {13126#true} call ULTIMATE.init(); {13133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:17,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {13133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13126#true} is VALID [2022-04-08 08:46:17,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {13126#true} assume true; {13126#true} is VALID [2022-04-08 08:46:17,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13126#true} {13126#true} #703#return; {13126#true} is VALID [2022-04-08 08:46:17,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {13126#true} call #t~ret161 := main(); {13126#true} is VALID [2022-04-08 08:46:17,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {13126#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13126#true} is VALID [2022-04-08 08:46:17,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {13126#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {13126#true} is VALID [2022-04-08 08:46:17,928 INFO L272 TraceCheckUtils]: 7: Hoare triple {13126#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13126#true} is VALID [2022-04-08 08:46:17,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {13126#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:17,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {13131#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13132#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 08:46:17,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {13132#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {13127#false} is VALID [2022-04-08 08:46:17,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {13127#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {13127#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13127#false} is VALID [2022-04-08 08:46:17,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {13127#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {13127#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {13127#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {13127#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {13127#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {13127#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {13127#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {13127#false} ~skip~0 := 0; {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {13127#false} assume !false; {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {13127#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {13127#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {13127#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {13127#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {13127#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {13127#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {13127#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {13127#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {13127#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {13127#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {13127#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {13127#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {13127#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {13127#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {13127#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {13127#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {13127#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {13127#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {13127#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {13127#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {13127#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {13127#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {13127#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {13127#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {13127#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {13127#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {13127#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {13127#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {13127#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {13127#false} assume 8640 == #t~mem75;havoc #t~mem75; {13127#false} is VALID [2022-04-08 08:46:17,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {13127#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {13127#false} is VALID [2022-04-08 08:46:17,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {13127#false} assume !(4 == ~blastFlag~0); {13127#false} is VALID [2022-04-08 08:46:17,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {13127#false} assume !(7 == ~blastFlag~0); {13127#false} is VALID [2022-04-08 08:46:17,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {13127#false} assume !(10 == ~blastFlag~0); {13127#false} is VALID [2022-04-08 08:46:17,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {13127#false} assume !false; {13127#false} is VALID [2022-04-08 08:46:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:17,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296021007] [2022-04-08 08:46:17,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296021007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:17,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:17,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:17,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:17,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1311794502] [2022-04-08 08:46:17,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1311794502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:17,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:17,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19244095] [2022-04-08 08:46:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:17,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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 66 [2022-04-08 08:46:17,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:17,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:17,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:17,983 INFO L87 Difference]: Start difference. First operand 190 states and 286 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:22,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:26,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:26,982 INFO L93 Difference]: Finished difference Result 367 states and 558 transitions. [2022-04-08 08:46:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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 66 [2022-04-08 08:46:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 08:46:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 08:46:26,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-08 08:46:27,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:27,276 INFO L225 Difference]: With dead ends: 367 [2022-04-08 08:46:27,276 INFO L226 Difference]: Without dead ends: 203 [2022-04-08 08:46:27,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:27,277 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 20 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:27,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 507 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 08:46:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-08 08:46:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 190. [2022-04-08 08:46:27,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:27,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,282 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,283 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:27,285 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2022-04-08 08:46:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 302 transitions. [2022-04-08 08:46:27,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:27,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:27,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 3 states have call successors, (3), 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 203 states. [2022-04-08 08:46:27,317 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 3 states have call successors, (3), 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 203 states. [2022-04-08 08:46:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:27,319 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2022-04-08 08:46:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 302 transitions. [2022-04-08 08:46:27,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:27,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:27,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:27,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.518918918918919) internal successors, (281), 185 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 285 transitions. [2022-04-08 08:46:27,323 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 285 transitions. Word has length 66 [2022-04-08 08:46:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:27,323 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 285 transitions. [2022-04-08 08:46:27,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:27,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 285 transitions. [2022-04-08 08:46:27,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 285 transitions. [2022-04-08 08:46:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:46:27,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:27,511 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:27,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2022-04-08 08:46:27,511 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1389450925, now seen corresponding path program 1 times [2022-04-08 08:46:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:27,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955227710] [2022-04-08 08:46:27,655 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:27,656 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -173338480, now seen corresponding path program 1 times [2022-04-08 08:46:27,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:27,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717318705] [2022-04-08 08:46:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:27,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:46:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:27,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:46:27,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1389450925, now seen corresponding path program 2 times [2022-04-08 08:46:27,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:27,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706147302] [2022-04-08 08:46:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:28,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {14665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14658#true} is VALID [2022-04-08 08:46:28,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {14658#true} assume true; {14658#true} is VALID [2022-04-08 08:46:28,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14658#true} {14658#true} #703#return; {14658#true} is VALID [2022-04-08 08:46:28,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {14658#true} call ULTIMATE.init(); {14665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:28,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {14665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14658#true} is VALID [2022-04-08 08:46:28,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {14658#true} assume true; {14658#true} is VALID [2022-04-08 08:46:28,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14658#true} {14658#true} #703#return; {14658#true} is VALID [2022-04-08 08:46:28,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {14658#true} call #t~ret161 := main(); {14658#true} is VALID [2022-04-08 08:46:28,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {14658#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14658#true} is VALID [2022-04-08 08:46:28,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {14658#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {14658#true} is VALID [2022-04-08 08:46:28,003 INFO L272 TraceCheckUtils]: 7: Hoare triple {14658#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14658#true} is VALID [2022-04-08 08:46:28,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {14658#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:28,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {14663#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14664#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 08:46:28,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {14664#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {14659#false} is VALID [2022-04-08 08:46:28,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {14659#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {14659#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {14659#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {14659#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {14659#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {14659#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {14659#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {14659#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {14659#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {14659#false} ~skip~0 := 0; {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {14659#false} assume !false; {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {14659#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {14659#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {14659#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {14659#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {14659#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {14659#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {14659#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {14659#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {14659#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {14659#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {14659#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {14659#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {14659#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {14659#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {14659#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {14659#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {14659#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {14659#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {14659#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {14659#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {14659#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {14659#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {14659#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {14659#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {14659#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {14659#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {14659#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 59: Hoare triple {14659#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 60: Hoare triple {14659#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 61: Hoare triple {14659#false} assume 8640 == #t~mem75;havoc #t~mem75; {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {14659#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 63: Hoare triple {14659#false} assume !(4 == ~blastFlag~0); {14659#false} is VALID [2022-04-08 08:46:28,012 INFO L290 TraceCheckUtils]: 64: Hoare triple {14659#false} assume !(7 == ~blastFlag~0); {14659#false} is VALID [2022-04-08 08:46:28,013 INFO L290 TraceCheckUtils]: 65: Hoare triple {14659#false} assume !(10 == ~blastFlag~0); {14659#false} is VALID [2022-04-08 08:46:28,013 INFO L290 TraceCheckUtils]: 66: Hoare triple {14659#false} assume !false; {14659#false} is VALID [2022-04-08 08:46:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:28,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706147302] [2022-04-08 08:46:28,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706147302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:28,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:28,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:28,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955227710] [2022-04-08 08:46:28,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955227710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:28,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:28,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:28,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353126807] [2022-04-08 08:46:28,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:46:28,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:28,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:28,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:28,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:28,065 INFO L87 Difference]: Start difference. First operand 190 states and 285 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:34,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:36,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:37,746 INFO L93 Difference]: Finished difference Result 454 states and 694 transitions. [2022-04-08 08:46:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:46:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-08 08:46:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-08 08:46:37,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-08 08:46:38,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:38,150 INFO L225 Difference]: With dead ends: 454 [2022-04-08 08:46:38,151 INFO L226 Difference]: Without dead ends: 290 [2022-04-08 08:46:38,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:38,151 INFO L913 BasicCegarLoop]: 123 mSDtfsCounter, 145 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:38,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 360 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 08:46:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-04-08 08:46:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 190. [2022-04-08 08:46:38,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:38,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand has 190 states, 185 states have (on average 1.5027027027027027) internal successors, (278), 185 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,158 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand has 190 states, 185 states have (on average 1.5027027027027027) internal successors, (278), 185 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,158 INFO L87 Difference]: Start difference. First operand 290 states. Second operand has 190 states, 185 states have (on average 1.5027027027027027) internal successors, (278), 185 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:38,162 INFO L93 Difference]: Finished difference Result 290 states and 436 transitions. [2022-04-08 08:46:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2022-04-08 08:46:38,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:38,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:38,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.5027027027027027) internal successors, (278), 185 states have internal predecessors, (278), 3 states have call successors, (3), 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 290 states. [2022-04-08 08:46:38,163 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.5027027027027027) internal successors, (278), 185 states have internal predecessors, (278), 3 states have call successors, (3), 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 290 states. [2022-04-08 08:46:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:38,166 INFO L93 Difference]: Finished difference Result 290 states and 436 transitions. [2022-04-08 08:46:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2022-04-08 08:46:38,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:38,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:38,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:38,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.5027027027027027) internal successors, (278), 185 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 282 transitions. [2022-04-08 08:46:38,170 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 282 transitions. Word has length 67 [2022-04-08 08:46:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:38,170 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 282 transitions. [2022-04-08 08:46:38,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 282 transitions. [2022-04-08 08:46:38,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 282 transitions. [2022-04-08 08:46:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:46:38,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:38,365 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:38,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2022-04-08 08:46:38,365 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1844946300, now seen corresponding path program 1 times [2022-04-08 08:46:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:38,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2013646034] [2022-04-08 08:46:38,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:38,380 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:38,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1844946300, now seen corresponding path program 2 times [2022-04-08 08:46:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234547987] [2022-04-08 08:46:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:38,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {16545#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16538#true} is VALID [2022-04-08 08:46:38,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {16538#true} assume true; {16538#true} is VALID [2022-04-08 08:46:38,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16538#true} {16538#true} #703#return; {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {16538#true} call ULTIMATE.init(); {16545#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:38,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {16545#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {16538#true} assume true; {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16538#true} {16538#true} #703#return; {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {16538#true} call #t~ret161 := main(); {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {16538#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {16538#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L272 TraceCheckUtils]: 7: Hoare triple {16538#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {16538#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {16538#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16538#true} is VALID [2022-04-08 08:46:38,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {16538#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {16538#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {16538#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {16538#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {16538#true} assume !false; {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {16538#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {16538#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {16538#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {16538#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {16538#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {16538#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {16538#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {16538#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {16538#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16538#true} is VALID [2022-04-08 08:46:38,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {16538#true} assume 8464 == #t~mem55;havoc #t~mem55; {16538#true} is VALID [2022-04-08 08:46:38,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {16538#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {16538#true} is VALID [2022-04-08 08:46:38,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {16538#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16538#true} is VALID [2022-04-08 08:46:38,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {16538#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:38,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {16543#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16544#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:46:38,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {16544#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {16539#false} is VALID [2022-04-08 08:46:38,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {16539#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16539#false} is VALID [2022-04-08 08:46:38,522 INFO L290 TraceCheckUtils]: 63: Hoare triple {16539#false} assume !(4 == ~blastFlag~0); {16539#false} is VALID [2022-04-08 08:46:38,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {16539#false} assume !(7 == ~blastFlag~0); {16539#false} is VALID [2022-04-08 08:46:38,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {16539#false} assume !(10 == ~blastFlag~0); {16539#false} is VALID [2022-04-08 08:46:38,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {16539#false} assume !false; {16539#false} is VALID [2022-04-08 08:46:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:38,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:38,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234547987] [2022-04-08 08:46:38,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234547987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:38,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:38,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:38,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:38,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2013646034] [2022-04-08 08:46:38,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2013646034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:38,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:38,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:38,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813535750] [2022-04-08 08:46:38,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:38,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:46:38,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:38,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:38,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:38,590 INFO L87 Difference]: Start difference. First operand 190 states and 282 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:41,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:46,958 INFO L93 Difference]: Finished difference Result 473 states and 716 transitions. [2022-04-08 08:46:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:46,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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 67 [2022-04-08 08:46:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-08 08:46:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-08 08:46:46,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-08 08:46:47,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:47,375 INFO L225 Difference]: With dead ends: 473 [2022-04-08 08:46:47,376 INFO L226 Difference]: Without dead ends: 309 [2022-04-08 08:46:47,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:47,376 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 121 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:47,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 362 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:46:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-08 08:46:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 230. [2022-04-08 08:46:47,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:47,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 230 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,384 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 230 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,385 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 230 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:47,389 INFO L93 Difference]: Finished difference Result 309 states and 462 transitions. [2022-04-08 08:46:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 462 transitions. [2022-04-08 08:46:47,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:47,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:47,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 3 states have call successors, (3), 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 309 states. [2022-04-08 08:46:47,390 INFO L87 Difference]: Start difference. First operand has 230 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 3 states have call successors, (3), 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 309 states. [2022-04-08 08:46:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:47,395 INFO L93 Difference]: Finished difference Result 309 states and 462 transitions. [2022-04-08 08:46:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 462 transitions. [2022-04-08 08:46:47,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:47,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:47,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:47,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 350 transitions. [2022-04-08 08:46:47,400 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 350 transitions. Word has length 67 [2022-04-08 08:46:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:47,400 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 350 transitions. [2022-04-08 08:46:47,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 350 transitions. [2022-04-08 08:46:47,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 350 transitions. [2022-04-08 08:46:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 08:46:47,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:47,653 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:47,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:46:47,653 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash -592202662, now seen corresponding path program 1 times [2022-04-08 08:46:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:47,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587388901] [2022-04-08 08:46:47,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:47,669 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:47,669 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -592202662, now seen corresponding path program 2 times [2022-04-08 08:46:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:47,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598928740] [2022-04-08 08:46:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:47,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:47,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {18581#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18574#true} is VALID [2022-04-08 08:46:47,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {18574#true} assume true; {18574#true} is VALID [2022-04-08 08:46:47,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18574#true} {18574#true} #703#return; {18574#true} is VALID [2022-04-08 08:46:47,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {18574#true} call ULTIMATE.init(); {18581#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {18574#true} assume true; {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18574#true} {18574#true} #703#return; {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {18574#true} call #t~ret161 := main(); {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {18574#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {18574#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L272 TraceCheckUtils]: 7: Hoare triple {18574#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {18574#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {18574#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {18574#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {18574#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18574#true} is VALID [2022-04-08 08:46:47,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {18574#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {18574#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {18574#true} assume !false; {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {18574#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {18574#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {18574#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {18574#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {18574#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {18574#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {18574#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {18574#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {18574#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {18574#true} assume 8464 == #t~mem55;havoc #t~mem55; {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {18574#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18574#true} is VALID [2022-04-08 08:46:47,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {18574#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18574#true} is VALID [2022-04-08 08:46:47,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {18574#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,778 INFO L290 TraceCheckUtils]: 46: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,782 INFO L290 TraceCheckUtils]: 59: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:47,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {18579#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18580#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 08:46:47,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {18580#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {18575#false} is VALID [2022-04-08 08:46:47,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {18575#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18575#false} is VALID [2022-04-08 08:46:47,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {18575#false} assume !(4 == ~blastFlag~0); {18575#false} is VALID [2022-04-08 08:46:47,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {18575#false} assume !(7 == ~blastFlag~0); {18575#false} is VALID [2022-04-08 08:46:47,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {18575#false} assume !(10 == ~blastFlag~0); {18575#false} is VALID [2022-04-08 08:46:47,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {18575#false} assume !false; {18575#false} is VALID [2022-04-08 08:46:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598928740] [2022-04-08 08:46:47,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598928740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:47,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:47,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:47,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587388901] [2022-04-08 08:46:47,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587388901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:47,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:47,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091271285] [2022-04-08 08:46:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:46:47,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:47,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:47,838 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:47,839 INFO L87 Difference]: Start difference. First operand 230 states and 350 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:51,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:53,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:55,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:56,698 INFO L93 Difference]: Finished difference Result 534 states and 825 transitions. [2022-04-08 08:46:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-04-08 08:46:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-08 08:46:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-08 08:46:56,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 603 transitions. [2022-04-08 08:46:57,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:57,079 INFO L225 Difference]: With dead ends: 534 [2022-04-08 08:46:57,079 INFO L226 Difference]: Without dead ends: 330 [2022-04-08 08:46:57,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:57,080 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 120 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:57,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 384 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 08:46:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-08 08:46:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 252. [2022-04-08 08:46:57,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:57,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 252 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 247 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,089 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 252 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 247 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,089 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 252 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 247 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:57,094 INFO L93 Difference]: Finished difference Result 330 states and 503 transitions. [2022-04-08 08:46:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 503 transitions. [2022-04-08 08:46:57,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:57,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:57,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 247 states have internal predecessors, (389), 3 states have call successors, (3), 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 330 states. [2022-04-08 08:46:57,095 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 247 states have internal predecessors, (389), 3 states have call successors, (3), 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 330 states. [2022-04-08 08:46:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:57,100 INFO L93 Difference]: Finished difference Result 330 states and 503 transitions. [2022-04-08 08:46:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 503 transitions. [2022-04-08 08:46:57,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:57,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:57,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:57,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 247 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 393 transitions. [2022-04-08 08:46:57,111 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 393 transitions. Word has length 68 [2022-04-08 08:46:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:57,111 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 393 transitions. [2022-04-08 08:46:57,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 393 transitions. [2022-04-08 08:46:57,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 393 transitions. [2022-04-08 08:46:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 08:46:57,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:57,393 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:57,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:46:57,394 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2120594285, now seen corresponding path program 1 times [2022-04-08 08:46:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:57,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1108571586] [2022-04-08 08:46:57,443 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:57,443 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:57,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2120594285, now seen corresponding path program 2 times [2022-04-08 08:46:57,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:57,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702710348] [2022-04-08 08:46:57,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:57,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {20825#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20818#true} is VALID [2022-04-08 08:46:57,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {20818#true} assume true; {20818#true} is VALID [2022-04-08 08:46:57,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20818#true} {20818#true} #703#return; {20818#true} is VALID [2022-04-08 08:46:57,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {20818#true} call ULTIMATE.init(); {20825#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:57,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {20825#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {20818#true} assume true; {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20818#true} {20818#true} #703#return; {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {20818#true} call #t~ret161 := main(); {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {20818#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {20818#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L272 TraceCheckUtils]: 7: Hoare triple {20818#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {20818#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {20818#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {20818#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {20818#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {20818#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {20818#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20818#true} is VALID [2022-04-08 08:46:57,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {20818#true} assume !false; {20818#true} is VALID [2022-04-08 08:46:57,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {20818#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {20818#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {20818#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {20818#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {20818#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {20818#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {20818#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {20818#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {20818#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20818#true} is VALID [2022-04-08 08:46:57,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {20818#true} assume 8464 == #t~mem55;havoc #t~mem55; {20818#true} is VALID [2022-04-08 08:46:57,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {20818#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {20818#true} is VALID [2022-04-08 08:46:57,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {20818#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20818#true} is VALID [2022-04-08 08:46:57,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {20818#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:57,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {20823#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20824#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:46:57,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {20824#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {20819#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {20819#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {20819#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {20819#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {20819#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {20819#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {20819#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {20819#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {20819#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {20819#false} assume 8448 == #t~mem68;havoc #t~mem68; {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {20819#false} assume !(~num1~0 > 0); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {20819#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {20819#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {20819#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {20819#false} ~skip~0 := 0; {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {20819#false} assume !false; {20819#false} is VALID [2022-04-08 08:46:57,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {20819#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {20819#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 63: Hoare triple {20819#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {20819#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {20819#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {20819#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {20819#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 68: Hoare triple {20819#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 69: Hoare triple {20819#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {20819#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {20819#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 72: Hoare triple {20819#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {20819#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 74: Hoare triple {20819#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,561 INFO L290 TraceCheckUtils]: 75: Hoare triple {20819#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {20819#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {20819#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 78: Hoare triple {20819#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 79: Hoare triple {20819#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {20819#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {20819#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {20819#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {20819#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 84: Hoare triple {20819#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 85: Hoare triple {20819#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 86: Hoare triple {20819#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 87: Hoare triple {20819#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 88: Hoare triple {20819#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {20819#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20819#false} is VALID [2022-04-08 08:46:57,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {20819#false} assume 8640 == #t~mem75;havoc #t~mem75; {20819#false} is VALID [2022-04-08 08:46:57,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {20819#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20819#false} is VALID [2022-04-08 08:46:57,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {20819#false} assume !(4 == ~blastFlag~0); {20819#false} is VALID [2022-04-08 08:46:57,563 INFO L290 TraceCheckUtils]: 93: Hoare triple {20819#false} assume !(7 == ~blastFlag~0); {20819#false} is VALID [2022-04-08 08:46:57,563 INFO L290 TraceCheckUtils]: 94: Hoare triple {20819#false} assume !(10 == ~blastFlag~0); {20819#false} is VALID [2022-04-08 08:46:57,563 INFO L290 TraceCheckUtils]: 95: Hoare triple {20819#false} assume !false; {20819#false} is VALID [2022-04-08 08:46:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 08:46:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:57,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702710348] [2022-04-08 08:46:57,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702710348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:57,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:57,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:57,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:57,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1108571586] [2022-04-08 08:46:57,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1108571586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:57,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:57,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983129629] [2022-04-08 08:46:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 96 [2022-04-08 08:46:57,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:57,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:57,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:57,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:57,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:57,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:57,629 INFO L87 Difference]: Start difference. First operand 252 states and 393 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:03,307 INFO L93 Difference]: Finished difference Result 518 states and 815 transitions. [2022-04-08 08:47:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 96 [2022-04-08 08:47:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:47:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:47:03,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-08 08:47:03,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:03,600 INFO L225 Difference]: With dead ends: 518 [2022-04-08 08:47:03,600 INFO L226 Difference]: Without dead ends: 292 [2022-04-08 08:47:03,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:03,601 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 29 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:03,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 525 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 08:47:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-08 08:47:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 274. [2022-04-08 08:47:03,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:03,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 274 states, 269 states have (on average 1.5687732342007434) internal successors, (422), 269 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,610 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 274 states, 269 states have (on average 1.5687732342007434) internal successors, (422), 269 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,610 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 274 states, 269 states have (on average 1.5687732342007434) internal successors, (422), 269 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:03,614 INFO L93 Difference]: Finished difference Result 292 states and 450 transitions. [2022-04-08 08:47:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2022-04-08 08:47:03,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:03,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:03,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 269 states have (on average 1.5687732342007434) internal successors, (422), 269 states have internal predecessors, (422), 3 states have call successors, (3), 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 292 states. [2022-04-08 08:47:03,615 INFO L87 Difference]: Start difference. First operand has 274 states, 269 states have (on average 1.5687732342007434) internal successors, (422), 269 states have internal predecessors, (422), 3 states have call successors, (3), 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 292 states. [2022-04-08 08:47:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:03,619 INFO L93 Difference]: Finished difference Result 292 states and 450 transitions. [2022-04-08 08:47:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2022-04-08 08:47:03,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:03,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:03,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:03,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.5687732342007434) internal successors, (422), 269 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 426 transitions. [2022-04-08 08:47:03,624 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 426 transitions. Word has length 96 [2022-04-08 08:47:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:03,625 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 426 transitions. [2022-04-08 08:47:03,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 274 states and 426 transitions. [2022-04-08 08:47:03,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 426 transitions. [2022-04-08 08:47:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 08:47:03,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:03,915 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:03,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:47:03,915 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 163057893, now seen corresponding path program 1 times [2022-04-08 08:47:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:03,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780915131] [2022-04-08 08:47:03,970 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:03,970 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:03,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 163057893, now seen corresponding path program 2 times [2022-04-08 08:47:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145645855] [2022-04-08 08:47:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:04,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {23005#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22998#true} is VALID [2022-04-08 08:47:04,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {22998#true} assume true; {22998#true} is VALID [2022-04-08 08:47:04,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22998#true} {22998#true} #703#return; {22998#true} is VALID [2022-04-08 08:47:04,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {22998#true} call ULTIMATE.init(); {23005#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:04,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {23005#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22998#true} is VALID [2022-04-08 08:47:04,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {22998#true} assume true; {22998#true} is VALID [2022-04-08 08:47:04,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22998#true} {22998#true} #703#return; {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {22998#true} call #t~ret161 := main(); {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {22998#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {22998#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L272 TraceCheckUtils]: 7: Hoare triple {22998#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {22998#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {22998#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {22998#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {22998#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {22998#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {22998#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {22998#true} assume !false; {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {22998#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {22998#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {22998#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {22998#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {22998#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {22998#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {22998#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {22998#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {22998#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {22998#true} assume 8464 == #t~mem55;havoc #t~mem55; {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {22998#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {22998#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {22998#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {22998#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {22998#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22998#true} is VALID [2022-04-08 08:47:04,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {22998#true} ~skip~0 := 0; {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {22998#true} assume !false; {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {22998#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {22998#true} assume 12292 == #t~mem47;havoc #t~mem47; {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {22998#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {22998#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {22998#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {22998#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {22998#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {22998#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {22998#true} is VALID [2022-04-08 08:47:04,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {22998#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {22998#true} is VALID [2022-04-08 08:47:04,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {22998#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {23003#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23004#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {23004#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {22999#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {22999#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {22999#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {22999#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {22999#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {22999#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {22999#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {22999#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {22999#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {22999#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 63: Hoare triple {22999#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 64: Hoare triple {22999#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {22999#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {22999#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 67: Hoare triple {22999#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {22999#false} assume 8448 == #t~mem68;havoc #t~mem68; {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {22999#false} assume !(~num1~0 > 0); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 70: Hoare triple {22999#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {22999#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {22999#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22999#false} is VALID [2022-04-08 08:47:04,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {22999#false} ~skip~0 := 0; {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 74: Hoare triple {22999#false} assume !false; {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 75: Hoare triple {22999#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 76: Hoare triple {22999#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 77: Hoare triple {22999#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 78: Hoare triple {22999#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 79: Hoare triple {22999#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 80: Hoare triple {22999#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 81: Hoare triple {22999#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 82: Hoare triple {22999#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 83: Hoare triple {22999#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 84: Hoare triple {22999#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 85: Hoare triple {22999#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 86: Hoare triple {22999#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,093 INFO L290 TraceCheckUtils]: 87: Hoare triple {22999#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 88: Hoare triple {22999#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 89: Hoare triple {22999#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 90: Hoare triple {22999#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 91: Hoare triple {22999#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 92: Hoare triple {22999#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 93: Hoare triple {22999#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 94: Hoare triple {22999#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 95: Hoare triple {22999#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 96: Hoare triple {22999#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 97: Hoare triple {22999#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 98: Hoare triple {22999#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 99: Hoare triple {22999#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 100: Hoare triple {22999#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,094 INFO L290 TraceCheckUtils]: 101: Hoare triple {22999#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 102: Hoare triple {22999#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 103: Hoare triple {22999#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 104: Hoare triple {22999#false} assume 8640 == #t~mem75;havoc #t~mem75; {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 105: Hoare triple {22999#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 106: Hoare triple {22999#false} assume !(4 == ~blastFlag~0); {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 107: Hoare triple {22999#false} assume !(7 == ~blastFlag~0); {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 108: Hoare triple {22999#false} assume !(10 == ~blastFlag~0); {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L290 TraceCheckUtils]: 109: Hoare triple {22999#false} assume !false; {22999#false} is VALID [2022-04-08 08:47:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 08:47:04,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:04,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145645855] [2022-04-08 08:47:04,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145645855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:04,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:04,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:04,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:04,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780915131] [2022-04-08 08:47:04,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780915131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:04,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:04,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572118812] [2022-04-08 08:47:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:04,097 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 110 [2022-04-08 08:47:04,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:04,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:04,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:04,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:04,161 INFO L87 Difference]: Start difference. First operand 274 states and 426 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:11,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:12,501 INFO L93 Difference]: Finished difference Result 535 states and 839 transitions. [2022-04-08 08:47:12,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:12,501 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 110 [2022-04-08 08:47:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:47:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:47:12,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-08 08:47:12,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:12,793 INFO L225 Difference]: With dead ends: 535 [2022-04-08 08:47:12,793 INFO L226 Difference]: Without dead ends: 287 [2022-04-08 08:47:12,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:12,794 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 20 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:12,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 586 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 08:47:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-08 08:47:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2022-04-08 08:47:12,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:12,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 274 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,802 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 274 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,803 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 274 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:12,806 INFO L93 Difference]: Finished difference Result 287 states and 441 transitions. [2022-04-08 08:47:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 441 transitions. [2022-04-08 08:47:12,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:12,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:12,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 3 states have call successors, (3), 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 287 states. [2022-04-08 08:47:12,807 INFO L87 Difference]: Start difference. First operand has 274 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 3 states have call successors, (3), 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 287 states. [2022-04-08 08:47:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:12,811 INFO L93 Difference]: Finished difference Result 287 states and 441 transitions. [2022-04-08 08:47:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 441 transitions. [2022-04-08 08:47:12,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:12,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:12,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:12,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 269 states have internal predecessors, (421), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 425 transitions. [2022-04-08 08:47:12,816 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 425 transitions. Word has length 110 [2022-04-08 08:47:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:12,816 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 425 transitions. [2022-04-08 08:47:12,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 274 states and 425 transitions. [2022-04-08 08:47:13,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 425 transitions. [2022-04-08 08:47:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 08:47:13,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:13,131 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:13,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:47:13,131 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1022338074, now seen corresponding path program 1 times [2022-04-08 08:47:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:13,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877892884] [2022-04-08 08:47:13,180 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:13,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:13,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1022338074, now seen corresponding path program 2 times [2022-04-08 08:47:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:13,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983650201] [2022-04-08 08:47:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:13,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:13,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {25210#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25202#true} is VALID [2022-04-08 08:47:13,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {25202#true} assume true; {25202#true} is VALID [2022-04-08 08:47:13,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25202#true} {25202#true} #703#return; {25202#true} is VALID [2022-04-08 08:47:13,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {25202#true} call ULTIMATE.init(); {25210#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:13,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {25210#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {25202#true} assume true; {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25202#true} {25202#true} #703#return; {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {25202#true} call #t~ret161 := main(); {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {25202#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {25202#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L272 TraceCheckUtils]: 7: Hoare triple {25202#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {25202#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {25202#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {25202#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {25202#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {25202#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {25202#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25202#true} is VALID [2022-04-08 08:47:13,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {25202#true} assume !false; {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {25202#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {25202#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {25202#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {25202#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {25202#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {25202#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {25202#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {25202#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {25202#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {25202#true} assume 8464 == #t~mem55;havoc #t~mem55; {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {25202#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {25202#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {25202#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {25202#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25202#true} is VALID [2022-04-08 08:47:13,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {25202#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25202#true} is VALID [2022-04-08 08:47:13,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {25202#true} ~skip~0 := 0; {25202#true} is VALID [2022-04-08 08:47:13,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {25202#true} assume !false; {25202#true} is VALID [2022-04-08 08:47:13,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {25202#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25207#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {25207#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:13,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {25208#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {25209#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-08 08:47:13,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {25209#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {25203#false} is VALID [2022-04-08 08:47:13,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {25203#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {25203#false} is VALID [2022-04-08 08:47:13,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {25203#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {25203#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25203#false} is VALID [2022-04-08 08:47:13,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {25203#false} ~skip~0 := 0; {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {25203#false} assume !false; {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {25203#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {25203#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {25203#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {25203#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {25203#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {25203#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {25203#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {25203#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {25203#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {25203#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {25203#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {25203#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,318 INFO L290 TraceCheckUtils]: 59: Hoare triple {25203#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {25203#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {25203#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {25203#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {25203#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {25203#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {25203#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {25203#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {25203#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {25203#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {25203#false} assume 8448 == #t~mem68;havoc #t~mem68; {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {25203#false} assume !(~num1~0 > 0); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 71: Hoare triple {25203#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {25203#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,319 INFO L290 TraceCheckUtils]: 73: Hoare triple {25203#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 74: Hoare triple {25203#false} ~skip~0 := 0; {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 75: Hoare triple {25203#false} assume !false; {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 76: Hoare triple {25203#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {25203#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 78: Hoare triple {25203#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {25203#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {25203#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {25203#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {25203#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 83: Hoare triple {25203#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 84: Hoare triple {25203#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 85: Hoare triple {25203#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {25203#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 87: Hoare triple {25203#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,320 INFO L290 TraceCheckUtils]: 88: Hoare triple {25203#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 89: Hoare triple {25203#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 90: Hoare triple {25203#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 91: Hoare triple {25203#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 92: Hoare triple {25203#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 93: Hoare triple {25203#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 94: Hoare triple {25203#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 95: Hoare triple {25203#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 96: Hoare triple {25203#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 97: Hoare triple {25203#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 98: Hoare triple {25203#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 99: Hoare triple {25203#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 100: Hoare triple {25203#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 101: Hoare triple {25203#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,321 INFO L290 TraceCheckUtils]: 102: Hoare triple {25203#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 103: Hoare triple {25203#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 104: Hoare triple {25203#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 105: Hoare triple {25203#false} assume 8640 == #t~mem75;havoc #t~mem75; {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 106: Hoare triple {25203#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 107: Hoare triple {25203#false} assume !(4 == ~blastFlag~0); {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 108: Hoare triple {25203#false} assume !(7 == ~blastFlag~0); {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 109: Hoare triple {25203#false} assume !(10 == ~blastFlag~0); {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L290 TraceCheckUtils]: 110: Hoare triple {25203#false} assume !false; {25203#false} is VALID [2022-04-08 08:47:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 08:47:13,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:13,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983650201] [2022-04-08 08:47:13,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983650201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:13,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:13,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:47:13,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:13,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877892884] [2022-04-08 08:47:13,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877892884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:13,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:13,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:47:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091878532] [2022-04-08 08:47:13,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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 111 [2022-04-08 08:47:13,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:13,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:13,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:13,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:47:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:47:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:13,395 INFO L87 Difference]: Start difference. First operand 274 states and 425 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:18,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:24,309 INFO L93 Difference]: Finished difference Result 531 states and 833 transitions. [2022-04-08 08:47:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:47:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 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 111 [2022-04-08 08:47:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 434 transitions. [2022-04-08 08:47:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 434 transitions. [2022-04-08 08:47:24,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 434 transitions. [2022-04-08 08:47:24,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:24,561 INFO L225 Difference]: With dead ends: 531 [2022-04-08 08:47:24,561 INFO L226 Difference]: Without dead ends: 283 [2022-04-08 08:47:24,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:47:24,562 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 3 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:24,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 655 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 08:47:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-08 08:47:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-04-08 08:47:24,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:24,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 283 states, 278 states have (on average 1.5539568345323742) internal successors, (432), 278 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:24,570 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 283 states, 278 states have (on average 1.5539568345323742) internal successors, (432), 278 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:24,570 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 283 states, 278 states have (on average 1.5539568345323742) internal successors, (432), 278 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:24,586 INFO L93 Difference]: Finished difference Result 283 states and 436 transitions. [2022-04-08 08:47:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 436 transitions. [2022-04-08 08:47:24,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:24,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:24,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 283 states, 278 states have (on average 1.5539568345323742) internal successors, (432), 278 states have internal predecessors, (432), 3 states have call successors, (3), 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 283 states. [2022-04-08 08:47:24,587 INFO L87 Difference]: Start difference. First operand has 283 states, 278 states have (on average 1.5539568345323742) internal successors, (432), 278 states have internal predecessors, (432), 3 states have call successors, (3), 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 283 states. [2022-04-08 08:47:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:24,591 INFO L93 Difference]: Finished difference Result 283 states and 436 transitions. [2022-04-08 08:47:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 436 transitions. [2022-04-08 08:47:24,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:24,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:24,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:24,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.5539568345323742) internal successors, (432), 278 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 436 transitions. [2022-04-08 08:47:24,596 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 436 transitions. Word has length 111 [2022-04-08 08:47:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:24,596 INFO L478 AbstractCegarLoop]: Abstraction has 283 states and 436 transitions. [2022-04-08 08:47:24,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:24,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 283 states and 436 transitions. [2022-04-08 08:47:24,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 436 transitions. [2022-04-08 08:47:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-08 08:47:24,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:24,884 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:24,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:47:24,884 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1703536797, now seen corresponding path program 1 times [2022-04-08 08:47:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560616048] [2022-04-08 08:47:24,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:24,946 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:24,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1703536797, now seen corresponding path program 2 times [2022-04-08 08:47:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:24,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921901911] [2022-04-08 08:47:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:25,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {27416#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27409#true} is VALID [2022-04-08 08:47:25,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {27409#true} assume true; {27409#true} is VALID [2022-04-08 08:47:25,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27409#true} {27409#true} #703#return; {27409#true} is VALID [2022-04-08 08:47:25,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {27409#true} call ULTIMATE.init(); {27416#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:25,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {27416#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27409#true} is VALID [2022-04-08 08:47:25,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {27409#true} assume true; {27409#true} is VALID [2022-04-08 08:47:25,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27409#true} {27409#true} #703#return; {27409#true} is VALID [2022-04-08 08:47:25,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {27409#true} call #t~ret161 := main(); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {27409#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {27409#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L272 TraceCheckUtils]: 7: Hoare triple {27409#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {27409#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {27409#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {27409#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {27409#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {27409#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {27409#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {27409#true} assume !false; {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {27409#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {27409#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {27409#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {27409#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {27409#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {27409#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {27409#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {27409#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {27409#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {27409#true} assume 8464 == #t~mem55;havoc #t~mem55; {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {27409#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27409#true} is VALID [2022-04-08 08:47:25,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {27409#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27409#true} is VALID [2022-04-08 08:47:25,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {27409#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:25,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:25,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:25,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:25,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:25,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:25,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:25,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {27414#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27415#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-08 08:47:25,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {27415#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {27410#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {27410#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {27410#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {27410#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {27410#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {27410#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {27410#false} assume 12292 != #t~mem85;havoc #t~mem85; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {27410#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {27410#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {27410#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {27410#false} ~skip~0 := 0; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {27410#false} assume !false; {27410#false} is VALID [2022-04-08 08:47:25,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {27410#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {27410#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {27410#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {27410#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {27410#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {27410#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {27410#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {27410#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {27410#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {27410#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {27410#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {27410#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 60: Hoare triple {27410#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {27410#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,059 INFO L290 TraceCheckUtils]: 62: Hoare triple {27410#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {27410#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {27410#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {27410#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {27410#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {27410#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {27410#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {27410#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {27410#false} assume 8448 == #t~mem68;havoc #t~mem68; {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {27410#false} assume !(~num1~0 > 0); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {27410#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {27410#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {27410#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {27410#false} ~skip~0 := 0; {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {27410#false} assume !false; {27410#false} is VALID [2022-04-08 08:47:25,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {27410#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 78: Hoare triple {27410#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {27410#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 80: Hoare triple {27410#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 81: Hoare triple {27410#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 82: Hoare triple {27410#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 83: Hoare triple {27410#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 84: Hoare triple {27410#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 85: Hoare triple {27410#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 86: Hoare triple {27410#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 87: Hoare triple {27410#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {27410#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {27410#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 90: Hoare triple {27410#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,061 INFO L290 TraceCheckUtils]: 91: Hoare triple {27410#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,063 INFO L290 TraceCheckUtils]: 92: Hoare triple {27410#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 93: Hoare triple {27410#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 94: Hoare triple {27410#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 95: Hoare triple {27410#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 96: Hoare triple {27410#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 97: Hoare triple {27410#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 98: Hoare triple {27410#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 99: Hoare triple {27410#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 100: Hoare triple {27410#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 101: Hoare triple {27410#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 102: Hoare triple {27410#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {27410#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 104: Hoare triple {27410#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 105: Hoare triple {27410#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {27410#false} is VALID [2022-04-08 08:47:25,064 INFO L290 TraceCheckUtils]: 106: Hoare triple {27410#false} assume 8640 == #t~mem75;havoc #t~mem75; {27410#false} is VALID [2022-04-08 08:47:25,065 INFO L290 TraceCheckUtils]: 107: Hoare triple {27410#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {27410#false} is VALID [2022-04-08 08:47:25,065 INFO L290 TraceCheckUtils]: 108: Hoare triple {27410#false} assume !(4 == ~blastFlag~0); {27410#false} is VALID [2022-04-08 08:47:25,065 INFO L290 TraceCheckUtils]: 109: Hoare triple {27410#false} assume !(7 == ~blastFlag~0); {27410#false} is VALID [2022-04-08 08:47:25,065 INFO L290 TraceCheckUtils]: 110: Hoare triple {27410#false} assume !(10 == ~blastFlag~0); {27410#false} is VALID [2022-04-08 08:47:25,065 INFO L290 TraceCheckUtils]: 111: Hoare triple {27410#false} assume !false; {27410#false} is VALID [2022-04-08 08:47:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:47:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921901911] [2022-04-08 08:47:25,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921901911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:25,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:25,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:25,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:25,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560616048] [2022-04-08 08:47:25,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560616048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:25,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:25,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923635434] [2022-04-08 08:47:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 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 112 [2022-04-08 08:47:25,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:25,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:25,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:25,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:25,121 INFO L87 Difference]: Start difference. First operand 283 states and 436 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:28,276 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:32,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:33,254 INFO L93 Difference]: Finished difference Result 567 states and 878 transitions. [2022-04-08 08:47:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:33,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 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 112 [2022-04-08 08:47:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:47:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:47:33,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-08 08:47:33,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:33,534 INFO L225 Difference]: With dead ends: 567 [2022-04-08 08:47:33,534 INFO L226 Difference]: Without dead ends: 310 [2022-04-08 08:47:33,535 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:33,535 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 37 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:33,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 525 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 08:47:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-08 08:47:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 283. [2022-04-08 08:47:33,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:33,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 283 states, 278 states have (on average 1.5503597122302157) internal successors, (431), 278 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:33,548 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 283 states, 278 states have (on average 1.5503597122302157) internal successors, (431), 278 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:33,548 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 283 states, 278 states have (on average 1.5503597122302157) internal successors, (431), 278 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:33,552 INFO L93 Difference]: Finished difference Result 310 states and 470 transitions. [2022-04-08 08:47:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 470 transitions. [2022-04-08 08:47:33,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:33,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:33,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 283 states, 278 states have (on average 1.5503597122302157) internal successors, (431), 278 states have internal predecessors, (431), 3 states have call successors, (3), 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 310 states. [2022-04-08 08:47:33,553 INFO L87 Difference]: Start difference. First operand has 283 states, 278 states have (on average 1.5503597122302157) internal successors, (431), 278 states have internal predecessors, (431), 3 states have call successors, (3), 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 310 states. [2022-04-08 08:47:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:33,557 INFO L93 Difference]: Finished difference Result 310 states and 470 transitions. [2022-04-08 08:47:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 470 transitions. [2022-04-08 08:47:33,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:33,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:33,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:33,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.5503597122302157) internal successors, (431), 278 states have internal predecessors, (431), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2022-04-08 08:47:33,562 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 112 [2022-04-08 08:47:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:33,563 INFO L478 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2022-04-08 08:47:33,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:33,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 283 states and 435 transitions. [2022-04-08 08:47:33,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2022-04-08 08:47:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 08:47:33,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:33,868 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:33,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:47:33,868 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:33,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1562846625, now seen corresponding path program 1 times [2022-04-08 08:47:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:33,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469835945] [2022-04-08 08:47:33,923 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:33,923 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:33,923 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1562846625, now seen corresponding path program 2 times [2022-04-08 08:47:33,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:33,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622334739] [2022-04-08 08:47:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:34,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {29748#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29741#true} is VALID [2022-04-08 08:47:34,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {29741#true} assume true; {29741#true} is VALID [2022-04-08 08:47:34,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29741#true} {29741#true} #703#return; {29741#true} is VALID [2022-04-08 08:47:34,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {29741#true} call ULTIMATE.init(); {29748#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:34,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {29748#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29741#true} is VALID [2022-04-08 08:47:34,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {29741#true} assume true; {29741#true} is VALID [2022-04-08 08:47:34,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29741#true} {29741#true} #703#return; {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {29741#true} call #t~ret161 := main(); {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {29741#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {29741#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L272 TraceCheckUtils]: 7: Hoare triple {29741#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {29741#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {29741#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {29741#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {29741#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {29741#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {29741#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {29741#true} assume !false; {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {29741#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {29741#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {29741#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {29741#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {29741#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {29741#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {29741#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {29741#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {29741#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {29741#true} assume 8464 == #t~mem55;havoc #t~mem55; {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {29741#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {29741#true} is VALID [2022-04-08 08:47:34,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {29741#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29741#true} is VALID [2022-04-08 08:47:34,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {29741#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {29746#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29747#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {29747#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {29742#false} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {29742#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {29742#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29742#false} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {29742#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {29742#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {29742#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {29742#false} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {29742#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {29742#false} assume 12292 != #t~mem85;havoc #t~mem85; {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {29742#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {29742#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {29742#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {29742#false} ~skip~0 := 0; {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {29742#false} assume !false; {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {29742#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {29742#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {29742#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {29742#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {29742#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {29742#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {29742#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {29742#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {29742#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {29742#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {29742#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {29742#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {29742#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {29742#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {29742#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 64: Hoare triple {29742#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 65: Hoare triple {29742#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 66: Hoare triple {29742#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 67: Hoare triple {29742#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 68: Hoare triple {29742#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 69: Hoare triple {29742#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 70: Hoare triple {29742#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,032 INFO L290 TraceCheckUtils]: 71: Hoare triple {29742#false} assume 8448 == #t~mem68;havoc #t~mem68; {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 72: Hoare triple {29742#false} assume !(~num1~0 > 0); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 73: Hoare triple {29742#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 74: Hoare triple {29742#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 75: Hoare triple {29742#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 76: Hoare triple {29742#false} ~skip~0 := 0; {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 77: Hoare triple {29742#false} assume !false; {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 78: Hoare triple {29742#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 79: Hoare triple {29742#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 80: Hoare triple {29742#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 81: Hoare triple {29742#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 82: Hoare triple {29742#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 83: Hoare triple {29742#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 84: Hoare triple {29742#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,033 INFO L290 TraceCheckUtils]: 85: Hoare triple {29742#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 86: Hoare triple {29742#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 87: Hoare triple {29742#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 88: Hoare triple {29742#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 89: Hoare triple {29742#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 90: Hoare triple {29742#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 91: Hoare triple {29742#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 92: Hoare triple {29742#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 93: Hoare triple {29742#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 94: Hoare triple {29742#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 95: Hoare triple {29742#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {29742#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 97: Hoare triple {29742#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 98: Hoare triple {29742#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,034 INFO L290 TraceCheckUtils]: 99: Hoare triple {29742#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 100: Hoare triple {29742#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 101: Hoare triple {29742#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 102: Hoare triple {29742#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 103: Hoare triple {29742#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 104: Hoare triple {29742#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 105: Hoare triple {29742#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 106: Hoare triple {29742#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 107: Hoare triple {29742#false} assume 8640 == #t~mem75;havoc #t~mem75; {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 108: Hoare triple {29742#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 109: Hoare triple {29742#false} assume !(4 == ~blastFlag~0); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 110: Hoare triple {29742#false} assume !(7 == ~blastFlag~0); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 111: Hoare triple {29742#false} assume !(10 == ~blastFlag~0); {29742#false} is VALID [2022-04-08 08:47:34,035 INFO L290 TraceCheckUtils]: 112: Hoare triple {29742#false} assume !false; {29742#false} is VALID [2022-04-08 08:47:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 08:47:34,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622334739] [2022-04-08 08:47:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622334739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:34,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:34,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469835945] [2022-04-08 08:47:34,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469835945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:34,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120449255] [2022-04-08 08:47:34,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 113 [2022-04-08 08:47:34,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:34,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:34,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:34,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:34,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:34,099 INFO L87 Difference]: Start difference. First operand 283 states and 435 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:37,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:41,374 INFO L93 Difference]: Finished difference Result 627 states and 962 transitions. [2022-04-08 08:47:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 113 [2022-04-08 08:47:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-08 08:47:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-08 08:47:41,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 602 transitions. [2022-04-08 08:47:41,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:41,744 INFO L225 Difference]: With dead ends: 627 [2022-04-08 08:47:41,744 INFO L226 Difference]: Without dead ends: 370 [2022-04-08 08:47:41,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:41,745 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 145 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:41,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 384 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 08:47:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-04-08 08:47:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 283. [2022-04-08 08:47:41,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:41,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 370 states. Second operand has 283 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 278 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:41,755 INFO L74 IsIncluded]: Start isIncluded. First operand 370 states. Second operand has 283 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 278 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:41,755 INFO L87 Difference]: Start difference. First operand 370 states. Second operand has 283 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 278 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:41,760 INFO L93 Difference]: Finished difference Result 370 states and 552 transitions. [2022-04-08 08:47:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 552 transitions. [2022-04-08 08:47:41,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:41,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:41,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 283 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 278 states have internal predecessors, (427), 3 states have call successors, (3), 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 370 states. [2022-04-08 08:47:41,761 INFO L87 Difference]: Start difference. First operand has 283 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 278 states have internal predecessors, (427), 3 states have call successors, (3), 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 370 states. [2022-04-08 08:47:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:41,766 INFO L93 Difference]: Finished difference Result 370 states and 552 transitions. [2022-04-08 08:47:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 552 transitions. [2022-04-08 08:47:41,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:41,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:41,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:41,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 278 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 431 transitions. [2022-04-08 08:47:41,771 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 431 transitions. Word has length 113 [2022-04-08 08:47:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:41,771 INFO L478 AbstractCegarLoop]: Abstraction has 283 states and 431 transitions. [2022-04-08 08:47:41,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:41,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 283 states and 431 transitions. [2022-04-08 08:47:42,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 431 transitions. [2022-04-08 08:47:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 08:47:42,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:42,083 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:42,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:47:42,083 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:42,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1938523382, now seen corresponding path program 1 times [2022-04-08 08:47:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:42,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157039090] [2022-04-08 08:47:42,141 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:42,141 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:42,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:42,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1938523382, now seen corresponding path program 2 times [2022-04-08 08:47:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:42,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249924891] [2022-04-08 08:47:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:42,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {32320#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32313#true} is VALID [2022-04-08 08:47:42,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {32313#true} assume true; {32313#true} is VALID [2022-04-08 08:47:42,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32313#true} {32313#true} #703#return; {32313#true} is VALID [2022-04-08 08:47:42,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {32313#true} call ULTIMATE.init(); {32320#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:42,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {32320#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32313#true} is VALID [2022-04-08 08:47:42,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {32313#true} assume true; {32313#true} is VALID [2022-04-08 08:47:42,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32313#true} {32313#true} #703#return; {32313#true} is VALID [2022-04-08 08:47:42,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {32313#true} call #t~ret161 := main(); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {32313#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {32313#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L272 TraceCheckUtils]: 7: Hoare triple {32313#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {32313#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {32313#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {32313#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {32313#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {32313#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {32313#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {32313#true} assume !false; {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {32313#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {32313#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {32313#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {32313#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {32313#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {32313#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {32313#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {32313#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {32313#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {32313#true} assume 8464 == #t~mem55;havoc #t~mem55; {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {32313#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {32313#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {32313#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {32313#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {32313#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {32313#true} ~skip~0 := 0; {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {32313#true} assume !false; {32313#true} is VALID [2022-04-08 08:47:42,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {32313#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {32313#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {32313#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {32313#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {32313#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {32313#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {32313#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {32313#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {32313#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {32313#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {32313#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {32313#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {32313#true} assume 8496 == #t~mem58;havoc #t~mem58; {32313#true} is VALID [2022-04-08 08:47:42,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {32313#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {32313#true} is VALID [2022-04-08 08:47:42,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {32313#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32313#true} is VALID [2022-04-08 08:47:42,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {32313#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {32313#true} is VALID [2022-04-08 08:47:42,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {32313#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,257 INFO L290 TraceCheckUtils]: 63: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,257 INFO L290 TraceCheckUtils]: 64: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,257 INFO L290 TraceCheckUtils]: 65: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,258 INFO L290 TraceCheckUtils]: 66: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,258 INFO L290 TraceCheckUtils]: 67: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,259 INFO L290 TraceCheckUtils]: 69: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,259 INFO L290 TraceCheckUtils]: 70: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,259 INFO L290 TraceCheckUtils]: 71: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,260 INFO L290 TraceCheckUtils]: 72: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,260 INFO L290 TraceCheckUtils]: 73: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,260 INFO L290 TraceCheckUtils]: 74: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 75: Hoare triple {32318#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32319#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {32319#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {32314#false} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {32314#false} assume !(~num1~0 > 0); {32314#false} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 78: Hoare triple {32314#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {32314#false} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 79: Hoare triple {32314#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 80: Hoare triple {32314#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32314#false} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 81: Hoare triple {32314#false} ~skip~0 := 0; {32314#false} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 82: Hoare triple {32314#false} assume !false; {32314#false} is VALID [2022-04-08 08:47:42,261 INFO L290 TraceCheckUtils]: 83: Hoare triple {32314#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {32314#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {32314#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 86: Hoare triple {32314#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 87: Hoare triple {32314#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 88: Hoare triple {32314#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 89: Hoare triple {32314#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 90: Hoare triple {32314#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 91: Hoare triple {32314#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 92: Hoare triple {32314#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {32314#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 94: Hoare triple {32314#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 95: Hoare triple {32314#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 96: Hoare triple {32314#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,262 INFO L290 TraceCheckUtils]: 97: Hoare triple {32314#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {32314#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 99: Hoare triple {32314#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 100: Hoare triple {32314#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 101: Hoare triple {32314#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {32314#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 103: Hoare triple {32314#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 104: Hoare triple {32314#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {32314#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {32314#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 107: Hoare triple {32314#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 108: Hoare triple {32314#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 109: Hoare triple {32314#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,263 INFO L290 TraceCheckUtils]: 110: Hoare triple {32314#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {32314#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L290 TraceCheckUtils]: 112: Hoare triple {32314#false} assume 8640 == #t~mem75;havoc #t~mem75; {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L290 TraceCheckUtils]: 113: Hoare triple {32314#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L290 TraceCheckUtils]: 114: Hoare triple {32314#false} assume !(4 == ~blastFlag~0); {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L290 TraceCheckUtils]: 115: Hoare triple {32314#false} assume !(7 == ~blastFlag~0); {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L290 TraceCheckUtils]: 116: Hoare triple {32314#false} assume !(10 == ~blastFlag~0); {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L290 TraceCheckUtils]: 117: Hoare triple {32314#false} assume !false; {32314#false} is VALID [2022-04-08 08:47:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:47:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:42,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249924891] [2022-04-08 08:47:42,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249924891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:42,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:42,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:42,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:42,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157039090] [2022-04-08 08:47:42,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157039090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:42,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:42,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2301756] [2022-04-08 08:47:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 08:47:42,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:42,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:42,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:42,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:42,340 INFO L87 Difference]: Start difference. First operand 283 states and 431 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:44,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:46,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:51,535 INFO L93 Difference]: Finished difference Result 703 states and 1084 transitions. [2022-04-08 08:47:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:51,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-08 08:47:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 08:47:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 08:47:51,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-08 08:47:51,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:51,907 INFO L225 Difference]: With dead ends: 703 [2022-04-08 08:47:51,907 INFO L226 Difference]: Without dead ends: 446 [2022-04-08 08:47:51,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:51,908 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 125 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:51,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 396 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 08:47:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-04-08 08:47:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 347. [2022-04-08 08:47:51,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:51,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 446 states. Second operand has 347 states, 342 states have (on average 1.5526315789473684) internal successors, (531), 342 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,921 INFO L74 IsIncluded]: Start isIncluded. First operand 446 states. Second operand has 347 states, 342 states have (on average 1.5526315789473684) internal successors, (531), 342 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,921 INFO L87 Difference]: Start difference. First operand 446 states. Second operand has 347 states, 342 states have (on average 1.5526315789473684) internal successors, (531), 342 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:51,928 INFO L93 Difference]: Finished difference Result 446 states and 680 transitions. [2022-04-08 08:47:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 680 transitions. [2022-04-08 08:47:51,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:51,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:51,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 347 states, 342 states have (on average 1.5526315789473684) internal successors, (531), 342 states have internal predecessors, (531), 3 states have call successors, (3), 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 446 states. [2022-04-08 08:47:51,930 INFO L87 Difference]: Start difference. First operand has 347 states, 342 states have (on average 1.5526315789473684) internal successors, (531), 342 states have internal predecessors, (531), 3 states have call successors, (3), 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 446 states. [2022-04-08 08:47:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:51,937 INFO L93 Difference]: Finished difference Result 446 states and 680 transitions. [2022-04-08 08:47:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 680 transitions. [2022-04-08 08:47:51,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:51,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:51,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:51,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 342 states have (on average 1.5526315789473684) internal successors, (531), 342 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 535 transitions. [2022-04-08 08:47:51,943 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 535 transitions. Word has length 118 [2022-04-08 08:47:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:51,944 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 535 transitions. [2022-04-08 08:47:51,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 347 states and 535 transitions. [2022-04-08 08:47:52,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 535 transitions. [2022-04-08 08:47:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 08:47:52,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:52,351 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:52,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:47:52,351 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:52,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:52,351 INFO L85 PathProgramCache]: Analyzing trace with hash -609619681, now seen corresponding path program 1 times [2022-04-08 08:47:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:52,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958494278] [2022-04-08 08:47:52,419 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:52,419 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:52,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash -609619681, now seen corresponding path program 2 times [2022-04-08 08:47:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:52,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705286368] [2022-04-08 08:47:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:52,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:52,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {35324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35317#true} is VALID [2022-04-08 08:47:52,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {35317#true} assume true; {35317#true} is VALID [2022-04-08 08:47:52,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35317#true} {35317#true} #703#return; {35317#true} is VALID [2022-04-08 08:47:52,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {35317#true} call ULTIMATE.init(); {35324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:52,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {35324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35317#true} is VALID [2022-04-08 08:47:52,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {35317#true} assume true; {35317#true} is VALID [2022-04-08 08:47:52,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35317#true} {35317#true} #703#return; {35317#true} is VALID [2022-04-08 08:47:52,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {35317#true} call #t~ret161 := main(); {35317#true} is VALID [2022-04-08 08:47:52,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {35317#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {35317#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L272 TraceCheckUtils]: 7: Hoare triple {35317#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {35317#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {35317#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {35317#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {35317#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {35317#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {35317#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {35317#true} assume !false; {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {35317#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {35317#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {35317#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {35317#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {35317#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {35317#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {35317#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {35317#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {35317#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35317#true} is VALID [2022-04-08 08:47:52,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {35317#true} assume 8464 == #t~mem55;havoc #t~mem55; {35317#true} is VALID [2022-04-08 08:47:52,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {35317#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35317#true} is VALID [2022-04-08 08:47:52,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {35317#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35317#true} is VALID [2022-04-08 08:47:52,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {35317#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:52,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:52,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:52,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:52,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:52,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {35322#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35323#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 08:47:52,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {35323#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {35318#false} is VALID [2022-04-08 08:47:52,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {35318#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {35318#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {35318#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {35318#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {35318#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {35318#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {35318#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {35318#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {35318#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {35318#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {35318#false} ~skip~0 := 0; {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {35318#false} assume !false; {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {35318#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {35318#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {35318#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {35318#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {35318#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {35318#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {35318#false} assume 8480 == #t~mem52;havoc #t~mem52; {35318#false} is VALID [2022-04-08 08:47:52,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {35318#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {35318#false} is VALID [2022-04-08 08:47:52,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {35318#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {35318#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {35318#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35318#false} is VALID [2022-04-08 08:47:52,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {35318#false} ~skip~0 := 0; {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {35318#false} assume !false; {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {35318#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {35318#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {35318#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {35318#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {35318#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {35318#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {35318#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {35318#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {35318#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {35318#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {35318#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {35318#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 71: Hoare triple {35318#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {35318#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {35318#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 74: Hoare triple {35318#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 75: Hoare triple {35318#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {35318#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {35318#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {35318#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 79: Hoare triple {35318#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {35318#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 81: Hoare triple {35318#false} assume 8448 == #t~mem68;havoc #t~mem68; {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 82: Hoare triple {35318#false} assume !(~num1~0 > 0); {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 83: Hoare triple {35318#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {35318#false} is VALID [2022-04-08 08:47:52,534 INFO L290 TraceCheckUtils]: 84: Hoare triple {35318#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 85: Hoare triple {35318#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 86: Hoare triple {35318#false} ~skip~0 := 0; {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 87: Hoare triple {35318#false} assume !false; {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 88: Hoare triple {35318#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 89: Hoare triple {35318#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 90: Hoare triple {35318#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 91: Hoare triple {35318#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 92: Hoare triple {35318#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 93: Hoare triple {35318#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 94: Hoare triple {35318#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 95: Hoare triple {35318#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 96: Hoare triple {35318#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 97: Hoare triple {35318#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,535 INFO L290 TraceCheckUtils]: 98: Hoare triple {35318#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 99: Hoare triple {35318#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 100: Hoare triple {35318#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 101: Hoare triple {35318#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 102: Hoare triple {35318#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 103: Hoare triple {35318#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 104: Hoare triple {35318#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 105: Hoare triple {35318#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 106: Hoare triple {35318#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 107: Hoare triple {35318#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 108: Hoare triple {35318#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 109: Hoare triple {35318#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 110: Hoare triple {35318#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 111: Hoare triple {35318#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,536 INFO L290 TraceCheckUtils]: 112: Hoare triple {35318#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 113: Hoare triple {35318#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 114: Hoare triple {35318#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 115: Hoare triple {35318#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 116: Hoare triple {35318#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 117: Hoare triple {35318#false} assume 8640 == #t~mem75;havoc #t~mem75; {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 118: Hoare triple {35318#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 119: Hoare triple {35318#false} assume !(4 == ~blastFlag~0); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 120: Hoare triple {35318#false} assume !(7 == ~blastFlag~0); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 121: Hoare triple {35318#false} assume !(10 == ~blastFlag~0); {35318#false} is VALID [2022-04-08 08:47:52,537 INFO L290 TraceCheckUtils]: 122: Hoare triple {35318#false} assume !false; {35318#false} is VALID [2022-04-08 08:47:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 08:47:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705286368] [2022-04-08 08:47:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705286368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:52,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:52,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:52,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958494278] [2022-04-08 08:47:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958494278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:52,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:52,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841403716] [2022-04-08 08:47:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:52,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 123 [2022-04-08 08:47:52,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:52,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:52,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:52,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:52,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:52,596 INFO L87 Difference]: Start difference. First operand 347 states and 535 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:00,178 INFO L93 Difference]: Finished difference Result 745 states and 1150 transitions. [2022-04-08 08:48:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:00,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 123 [2022-04-08 08:48:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2022-04-08 08:48:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2022-04-08 08:48:00,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 600 transitions. [2022-04-08 08:48:00,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:00,570 INFO L225 Difference]: With dead ends: 745 [2022-04-08 08:48:00,571 INFO L226 Difference]: Without dead ends: 424 [2022-04-08 08:48:00,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:00,572 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 147 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:00,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 362 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 08:48:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-04-08 08:48:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 347. [2022-04-08 08:48:00,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:00,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand has 347 states, 342 states have (on average 1.5350877192982457) internal successors, (525), 342 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,585 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand has 347 states, 342 states have (on average 1.5350877192982457) internal successors, (525), 342 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,586 INFO L87 Difference]: Start difference. First operand 424 states. Second operand has 347 states, 342 states have (on average 1.5350877192982457) internal successors, (525), 342 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:00,599 INFO L93 Difference]: Finished difference Result 424 states and 638 transitions. [2022-04-08 08:48:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 638 transitions. [2022-04-08 08:48:00,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:00,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:00,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 347 states, 342 states have (on average 1.5350877192982457) internal successors, (525), 342 states have internal predecessors, (525), 3 states have call successors, (3), 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 424 states. [2022-04-08 08:48:00,601 INFO L87 Difference]: Start difference. First operand has 347 states, 342 states have (on average 1.5350877192982457) internal successors, (525), 342 states have internal predecessors, (525), 3 states have call successors, (3), 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 424 states. [2022-04-08 08:48:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:00,611 INFO L93 Difference]: Finished difference Result 424 states and 638 transitions. [2022-04-08 08:48:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 638 transitions. [2022-04-08 08:48:00,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:00,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:00,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:00,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 342 states have (on average 1.5350877192982457) internal successors, (525), 342 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 529 transitions. [2022-04-08 08:48:00,617 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 529 transitions. Word has length 123 [2022-04-08 08:48:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:00,617 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 529 transitions. [2022-04-08 08:48:00,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:00,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 347 states and 529 transitions. [2022-04-08 08:48:01,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 529 transitions. [2022-04-08 08:48:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 08:48:01,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:01,009 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:01,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:48:01,010 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:01,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2058494816, now seen corresponding path program 1 times [2022-04-08 08:48:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623225553] [2022-04-08 08:48:01,075 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:01,076 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:01,076 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2058494816, now seen corresponding path program 2 times [2022-04-08 08:48:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531062766] [2022-04-08 08:48:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:01,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:01,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {38368#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38361#true} is VALID [2022-04-08 08:48:01,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {38361#true} assume true; {38361#true} is VALID [2022-04-08 08:48:01,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38361#true} {38361#true} #703#return; {38361#true} is VALID [2022-04-08 08:48:01,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {38361#true} call ULTIMATE.init(); {38368#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:01,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {38368#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {38361#true} assume true; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38361#true} {38361#true} #703#return; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {38361#true} call #t~ret161 := main(); {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {38361#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {38361#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L272 TraceCheckUtils]: 7: Hoare triple {38361#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {38361#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {38361#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {38361#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {38361#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {38361#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {38361#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {38361#true} assume !false; {38361#true} is VALID [2022-04-08 08:48:01,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {38361#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {38361#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {38361#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {38361#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {38361#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {38361#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {38361#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {38361#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {38361#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {38361#true} assume 8464 == #t~mem55;havoc #t~mem55; {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {38361#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {38361#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {38361#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {38361#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {38361#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {38361#true} ~skip~0 := 0; {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {38361#true} assume !false; {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {38361#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {38361#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {38361#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {38361#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {38361#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {38361#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {38361#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {38361#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {38361#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {38361#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {38361#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {38361#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {38361#true} assume 8496 == #t~mem58;havoc #t~mem58; {38361#true} is VALID [2022-04-08 08:48:01,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {38361#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {38361#true} is VALID [2022-04-08 08:48:01,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {38361#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38361#true} is VALID [2022-04-08 08:48:01,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {38361#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {38361#true} is VALID [2022-04-08 08:48:01,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {38361#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,207 INFO L290 TraceCheckUtils]: 59: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,212 INFO L290 TraceCheckUtils]: 73: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:01,214 INFO L290 TraceCheckUtils]: 80: Hoare triple {38366#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {38367#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 08:48:01,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {38367#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {38362#false} is VALID [2022-04-08 08:48:01,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {38362#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {38362#false} is VALID [2022-04-08 08:48:01,214 INFO L290 TraceCheckUtils]: 83: Hoare triple {38362#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {38362#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,214 INFO L290 TraceCheckUtils]: 85: Hoare triple {38362#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 86: Hoare triple {38362#false} ~skip~0 := 0; {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 87: Hoare triple {38362#false} assume !false; {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 88: Hoare triple {38362#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 89: Hoare triple {38362#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 90: Hoare triple {38362#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 91: Hoare triple {38362#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 92: Hoare triple {38362#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 93: Hoare triple {38362#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 94: Hoare triple {38362#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 95: Hoare triple {38362#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 96: Hoare triple {38362#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 97: Hoare triple {38362#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,215 INFO L290 TraceCheckUtils]: 98: Hoare triple {38362#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 99: Hoare triple {38362#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 100: Hoare triple {38362#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 101: Hoare triple {38362#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 102: Hoare triple {38362#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 103: Hoare triple {38362#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 104: Hoare triple {38362#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 105: Hoare triple {38362#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 106: Hoare triple {38362#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 107: Hoare triple {38362#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {38362#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 109: Hoare triple {38362#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 110: Hoare triple {38362#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 111: Hoare triple {38362#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,216 INFO L290 TraceCheckUtils]: 112: Hoare triple {38362#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 113: Hoare triple {38362#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 114: Hoare triple {38362#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 115: Hoare triple {38362#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 116: Hoare triple {38362#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 117: Hoare triple {38362#false} assume 8640 == #t~mem75;havoc #t~mem75; {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 118: Hoare triple {38362#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 119: Hoare triple {38362#false} assume !(4 == ~blastFlag~0); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 120: Hoare triple {38362#false} assume !(7 == ~blastFlag~0); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 121: Hoare triple {38362#false} assume !(10 == ~blastFlag~0); {38362#false} is VALID [2022-04-08 08:48:01,217 INFO L290 TraceCheckUtils]: 122: Hoare triple {38362#false} assume !false; {38362#false} is VALID [2022-04-08 08:48:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:48:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531062766] [2022-04-08 08:48:01,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531062766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:01,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:01,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:01,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623225553] [2022-04-08 08:48:01,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623225553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:01,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:01,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947405505] [2022-04-08 08:48:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 123 [2022-04-08 08:48:01,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:01,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:01,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:01,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:01,293 INFO L87 Difference]: Start difference. First operand 347 states and 529 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:07,310 INFO L93 Difference]: Finished difference Result 785 states and 1203 transitions. [2022-04-08 08:48:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:07,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 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 123 [2022-04-08 08:48:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-08 08:48:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-08 08:48:07,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 599 transitions. [2022-04-08 08:48:07,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:07,707 INFO L225 Difference]: With dead ends: 785 [2022-04-08 08:48:07,707 INFO L226 Difference]: Without dead ends: 464 [2022-04-08 08:48:07,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:07,708 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 120 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:07,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 362 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:48:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-04-08 08:48:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2022-04-08 08:48:07,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:07,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states. Second operand has 384 states, 379 states have (on average 1.5408970976253298) internal successors, (584), 379 states have internal predecessors, (584), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,724 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states. Second operand has 384 states, 379 states have (on average 1.5408970976253298) internal successors, (584), 379 states have internal predecessors, (584), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,724 INFO L87 Difference]: Start difference. First operand 464 states. Second operand has 384 states, 379 states have (on average 1.5408970976253298) internal successors, (584), 379 states have internal predecessors, (584), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:07,732 INFO L93 Difference]: Finished difference Result 464 states and 701 transitions. [2022-04-08 08:48:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 701 transitions. [2022-04-08 08:48:07,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:07,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:07,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 379 states have (on average 1.5408970976253298) internal successors, (584), 379 states have internal predecessors, (584), 3 states have call successors, (3), 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 464 states. [2022-04-08 08:48:07,733 INFO L87 Difference]: Start difference. First operand has 384 states, 379 states have (on average 1.5408970976253298) internal successors, (584), 379 states have internal predecessors, (584), 3 states have call successors, (3), 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 464 states. [2022-04-08 08:48:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:07,741 INFO L93 Difference]: Finished difference Result 464 states and 701 transitions. [2022-04-08 08:48:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 701 transitions. [2022-04-08 08:48:07,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:07,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:07,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:07,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 379 states have (on average 1.5408970976253298) internal successors, (584), 379 states have internal predecessors, (584), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 588 transitions. [2022-04-08 08:48:07,748 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 588 transitions. Word has length 123 [2022-04-08 08:48:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:07,749 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 588 transitions. [2022-04-08 08:48:07,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:07,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 588 transitions. [2022-04-08 08:48:08,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 588 transitions. [2022-04-08 08:48:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-08 08:48:08,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:08,233 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:08,233 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:48:08,234 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash -426273800, now seen corresponding path program 1 times [2022-04-08 08:48:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:08,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438127118] [2022-04-08 08:48:08,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:08,300 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:08,300 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash -426273800, now seen corresponding path program 2 times [2022-04-08 08:48:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:08,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14609159] [2022-04-08 08:48:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:08,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {41646#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41639#true} is VALID [2022-04-08 08:48:08,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {41639#true} assume true; {41639#true} is VALID [2022-04-08 08:48:08,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41639#true} {41639#true} #703#return; {41639#true} is VALID [2022-04-08 08:48:08,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {41639#true} call ULTIMATE.init(); {41646#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:08,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {41646#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {41639#true} is VALID [2022-04-08 08:48:08,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {41639#true} assume true; {41639#true} is VALID [2022-04-08 08:48:08,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41639#true} {41639#true} #703#return; {41639#true} is VALID [2022-04-08 08:48:08,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {41639#true} call #t~ret161 := main(); {41639#true} is VALID [2022-04-08 08:48:08,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {41639#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {41639#true} is VALID [2022-04-08 08:48:08,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {41639#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {41639#true} is VALID [2022-04-08 08:48:08,422 INFO L272 TraceCheckUtils]: 7: Hoare triple {41639#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {41639#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {41639#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {41639#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {41639#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {41639#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {41639#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {41639#true} assume !false; {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {41639#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {41639#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {41639#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {41639#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {41639#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {41639#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {41639#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {41639#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {41639#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {41639#true} assume 8464 == #t~mem55;havoc #t~mem55; {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {41639#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {41639#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {41639#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {41639#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {41639#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {41639#true} ~skip~0 := 0; {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {41639#true} assume !false; {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {41639#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {41639#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {41639#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {41639#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {41639#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {41639#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {41639#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {41639#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {41639#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {41639#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {41639#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {41639#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {41639#true} assume 8496 == #t~mem58;havoc #t~mem58; {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {41639#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {41639#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41639#true} is VALID [2022-04-08 08:48:08,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {41639#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {41639#true} is VALID [2022-04-08 08:48:08,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {41639#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,429 INFO L290 TraceCheckUtils]: 54: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,429 INFO L290 TraceCheckUtils]: 55: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,432 INFO L290 TraceCheckUtils]: 63: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,432 INFO L290 TraceCheckUtils]: 64: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,432 INFO L290 TraceCheckUtils]: 65: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,433 INFO L290 TraceCheckUtils]: 67: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,436 INFO L290 TraceCheckUtils]: 75: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,436 INFO L290 TraceCheckUtils]: 77: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,437 INFO L290 TraceCheckUtils]: 79: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,437 INFO L290 TraceCheckUtils]: 80: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 81: Hoare triple {41644#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {41645#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 82: Hoare triple {41645#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {41640#false} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {41640#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {41640#false} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {41640#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 85: Hoare triple {41640#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {41640#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41640#false} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {41640#false} ~skip~0 := 0; {41640#false} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {41640#false} assume !false; {41640#false} is VALID [2022-04-08 08:48:08,438 INFO L290 TraceCheckUtils]: 89: Hoare triple {41640#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 90: Hoare triple {41640#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 91: Hoare triple {41640#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 92: Hoare triple {41640#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 93: Hoare triple {41640#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 94: Hoare triple {41640#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 95: Hoare triple {41640#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 96: Hoare triple {41640#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 97: Hoare triple {41640#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 98: Hoare triple {41640#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 99: Hoare triple {41640#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 100: Hoare triple {41640#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 101: Hoare triple {41640#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,439 INFO L290 TraceCheckUtils]: 102: Hoare triple {41640#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 103: Hoare triple {41640#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 104: Hoare triple {41640#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 105: Hoare triple {41640#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 106: Hoare triple {41640#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 107: Hoare triple {41640#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 108: Hoare triple {41640#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 109: Hoare triple {41640#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 110: Hoare triple {41640#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 111: Hoare triple {41640#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 112: Hoare triple {41640#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 113: Hoare triple {41640#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 114: Hoare triple {41640#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 115: Hoare triple {41640#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 116: Hoare triple {41640#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,440 INFO L290 TraceCheckUtils]: 117: Hoare triple {41640#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {41640#false} is VALID [2022-04-08 08:48:08,441 INFO L290 TraceCheckUtils]: 118: Hoare triple {41640#false} assume 8640 == #t~mem75;havoc #t~mem75; {41640#false} is VALID [2022-04-08 08:48:08,441 INFO L290 TraceCheckUtils]: 119: Hoare triple {41640#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {41640#false} is VALID [2022-04-08 08:48:08,441 INFO L290 TraceCheckUtils]: 120: Hoare triple {41640#false} assume !(4 == ~blastFlag~0); {41640#false} is VALID [2022-04-08 08:48:08,441 INFO L290 TraceCheckUtils]: 121: Hoare triple {41640#false} assume !(7 == ~blastFlag~0); {41640#false} is VALID [2022-04-08 08:48:08,441 INFO L290 TraceCheckUtils]: 122: Hoare triple {41640#false} assume !(10 == ~blastFlag~0); {41640#false} is VALID [2022-04-08 08:48:08,441 INFO L290 TraceCheckUtils]: 123: Hoare triple {41640#false} assume !false; {41640#false} is VALID [2022-04-08 08:48:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:48:08,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:08,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14609159] [2022-04-08 08:48:08,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14609159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:08,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:08,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:08,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:08,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438127118] [2022-04-08 08:48:08,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438127118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:08,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:08,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294612778] [2022-04-08 08:48:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:08,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 124 [2022-04-08 08:48:08,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:08,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:08,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:08,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:08,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:08,527 INFO L87 Difference]: Start difference. First operand 384 states and 588 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:13,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:16,424 INFO L93 Difference]: Finished difference Result 834 states and 1284 transitions. [2022-04-08 08:48:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 124 [2022-04-08 08:48:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-08 08:48:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-08 08:48:16,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 559 transitions. [2022-04-08 08:48:16,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:16,773 INFO L225 Difference]: With dead ends: 834 [2022-04-08 08:48:16,773 INFO L226 Difference]: Without dead ends: 476 [2022-04-08 08:48:16,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:16,774 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 78 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:16,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 493 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 08:48:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-04-08 08:48:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 424. [2022-04-08 08:48:16,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:16,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 476 states. Second operand has 424 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 419 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,791 INFO L74 IsIncluded]: Start isIncluded. First operand 476 states. Second operand has 424 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 419 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,791 INFO L87 Difference]: Start difference. First operand 476 states. Second operand has 424 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 419 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:16,799 INFO L93 Difference]: Finished difference Result 476 states and 724 transitions. [2022-04-08 08:48:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 724 transitions. [2022-04-08 08:48:16,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:16,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:16,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 419 states have internal predecessors, (647), 3 states have call successors, (3), 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 476 states. [2022-04-08 08:48:16,801 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 419 states have internal predecessors, (647), 3 states have call successors, (3), 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 476 states. [2022-04-08 08:48:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:16,808 INFO L93 Difference]: Finished difference Result 476 states and 724 transitions. [2022-04-08 08:48:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 724 transitions. [2022-04-08 08:48:16,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:16,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:16,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:16,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 419 states have internal predecessors, (647), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 651 transitions. [2022-04-08 08:48:16,817 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 651 transitions. Word has length 124 [2022-04-08 08:48:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:16,818 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 651 transitions. [2022-04-08 08:48:16,818 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 424 states and 651 transitions. [2022-04-08 08:48:17,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 651 edges. 651 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 651 transitions. [2022-04-08 08:48:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-08 08:48:17,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:17,305 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:17,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:48:17,305 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1791356598, now seen corresponding path program 1 times [2022-04-08 08:48:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1222858936] [2022-04-08 08:48:17,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:17,371 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:17,371 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1791356598, now seen corresponding path program 2 times [2022-04-08 08:48:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:17,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340399984] [2022-04-08 08:48:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:17,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {45126#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45119#true} is VALID [2022-04-08 08:48:17,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {45119#true} assume true; {45119#true} is VALID [2022-04-08 08:48:17,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45119#true} {45119#true} #703#return; {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {45119#true} call ULTIMATE.init(); {45126#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:17,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {45126#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {45119#true} assume true; {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45119#true} {45119#true} #703#return; {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {45119#true} call #t~ret161 := main(); {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {45119#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {45119#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L272 TraceCheckUtils]: 7: Hoare triple {45119#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {45119#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {45119#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {45119#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {45119#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {45119#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {45119#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {45119#true} assume !false; {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {45119#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {45119#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {45119#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {45119#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {45119#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {45119#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {45119#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {45119#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {45119#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {45119#true} assume 8464 == #t~mem55;havoc #t~mem55; {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {45119#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {45119#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {45119#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {45119#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {45119#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {45119#true} ~skip~0 := 0; {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {45119#true} assume !false; {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {45119#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {45119#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {45119#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {45119#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {45119#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {45119#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {45119#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {45119#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {45119#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {45119#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {45119#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {45119#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {45119#true} assume 8496 == #t~mem58;havoc #t~mem58; {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {45119#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {45119#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {45119#true} is VALID [2022-04-08 08:48:17,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {45119#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {45119#true} is VALID [2022-04-08 08:48:17,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {45119#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,483 INFO L290 TraceCheckUtils]: 61: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,485 INFO L290 TraceCheckUtils]: 67: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,485 INFO L290 TraceCheckUtils]: 68: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,485 INFO L290 TraceCheckUtils]: 69: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,486 INFO L290 TraceCheckUtils]: 70: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,486 INFO L290 TraceCheckUtils]: 71: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,486 INFO L290 TraceCheckUtils]: 72: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,487 INFO L290 TraceCheckUtils]: 73: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,487 INFO L290 TraceCheckUtils]: 74: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,487 INFO L290 TraceCheckUtils]: 75: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,488 INFO L290 TraceCheckUtils]: 76: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,488 INFO L290 TraceCheckUtils]: 77: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,488 INFO L290 TraceCheckUtils]: 78: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,488 INFO L290 TraceCheckUtils]: 79: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,489 INFO L290 TraceCheckUtils]: 80: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:48:17,489 INFO L290 TraceCheckUtils]: 81: Hoare triple {45124#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {45125#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-08 08:48:17,489 INFO L290 TraceCheckUtils]: 82: Hoare triple {45125#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {45120#false} is VALID [2022-04-08 08:48:17,489 INFO L290 TraceCheckUtils]: 83: Hoare triple {45120#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {45120#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 85: Hoare triple {45120#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {45120#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 87: Hoare triple {45120#false} ~skip~0 := 0; {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 88: Hoare triple {45120#false} assume !false; {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 89: Hoare triple {45120#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 90: Hoare triple {45120#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 91: Hoare triple {45120#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 92: Hoare triple {45120#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 93: Hoare triple {45120#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 94: Hoare triple {45120#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 95: Hoare triple {45120#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 96: Hoare triple {45120#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,490 INFO L290 TraceCheckUtils]: 97: Hoare triple {45120#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 98: Hoare triple {45120#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 99: Hoare triple {45120#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 100: Hoare triple {45120#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 101: Hoare triple {45120#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 102: Hoare triple {45120#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 103: Hoare triple {45120#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 104: Hoare triple {45120#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 105: Hoare triple {45120#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 106: Hoare triple {45120#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 107: Hoare triple {45120#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 108: Hoare triple {45120#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 109: Hoare triple {45120#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 110: Hoare triple {45120#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,491 INFO L290 TraceCheckUtils]: 111: Hoare triple {45120#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 112: Hoare triple {45120#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 113: Hoare triple {45120#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 114: Hoare triple {45120#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 115: Hoare triple {45120#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 116: Hoare triple {45120#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 117: Hoare triple {45120#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 118: Hoare triple {45120#false} assume 8640 == #t~mem75;havoc #t~mem75; {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 119: Hoare triple {45120#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 120: Hoare triple {45120#false} assume !(4 == ~blastFlag~0); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 121: Hoare triple {45120#false} assume !(7 == ~blastFlag~0); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 122: Hoare triple {45120#false} assume !(10 == ~blastFlag~0); {45120#false} is VALID [2022-04-08 08:48:17,492 INFO L290 TraceCheckUtils]: 123: Hoare triple {45120#false} assume !false; {45120#false} is VALID [2022-04-08 08:48:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:48:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:17,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340399984] [2022-04-08 08:48:17,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340399984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:17,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:17,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:17,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:17,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1222858936] [2022-04-08 08:48:17,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1222858936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:17,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:17,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306414809] [2022-04-08 08:48:17,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:17,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 124 [2022-04-08 08:48:17,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:17,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:17,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:17,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:17,572 INFO L87 Difference]: Start difference. First operand 424 states and 651 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:20,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:22,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:24,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:25,307 INFO L93 Difference]: Finished difference Result 899 states and 1382 transitions. [2022-04-08 08:48:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 124 [2022-04-08 08:48:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-08 08:48:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2022-04-08 08:48:25,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 599 transitions. [2022-04-08 08:48:25,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:25,693 INFO L225 Difference]: With dead ends: 899 [2022-04-08 08:48:25,693 INFO L226 Difference]: Without dead ends: 501 [2022-04-08 08:48:25,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:25,694 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 119 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:25,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 362 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-08 08:48:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-04-08 08:48:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 384. [2022-04-08 08:48:25,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:25,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 501 states. Second operand has 384 states, 379 states have (on average 1.5356200527704484) internal successors, (582), 379 states have internal predecessors, (582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:25,710 INFO L74 IsIncluded]: Start isIncluded. First operand 501 states. Second operand has 384 states, 379 states have (on average 1.5356200527704484) internal successors, (582), 379 states have internal predecessors, (582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:25,710 INFO L87 Difference]: Start difference. First operand 501 states. Second operand has 384 states, 379 states have (on average 1.5356200527704484) internal successors, (582), 379 states have internal predecessors, (582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:25,718 INFO L93 Difference]: Finished difference Result 501 states and 758 transitions. [2022-04-08 08:48:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 758 transitions. [2022-04-08 08:48:25,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:25,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:25,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 379 states have (on average 1.5356200527704484) internal successors, (582), 379 states have internal predecessors, (582), 3 states have call successors, (3), 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 501 states. [2022-04-08 08:48:25,720 INFO L87 Difference]: Start difference. First operand has 384 states, 379 states have (on average 1.5356200527704484) internal successors, (582), 379 states have internal predecessors, (582), 3 states have call successors, (3), 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 501 states. [2022-04-08 08:48:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:25,728 INFO L93 Difference]: Finished difference Result 501 states and 758 transitions. [2022-04-08 08:48:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 758 transitions. [2022-04-08 08:48:25,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:25,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:25,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:25,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 379 states have (on average 1.5356200527704484) internal successors, (582), 379 states have internal predecessors, (582), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2022-04-08 08:48:25,736 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 124 [2022-04-08 08:48:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:25,736 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2022-04-08 08:48:25,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:25,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 586 transitions. [2022-04-08 08:48:26,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2022-04-08 08:48:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 08:48:26,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:26,213 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:26,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:48:26,213 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:26,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2025254377, now seen corresponding path program 1 times [2022-04-08 08:48:26,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:26,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718623713] [2022-04-08 08:48:26,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:26,300 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:26,300 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2025254377, now seen corresponding path program 2 times [2022-04-08 08:48:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:26,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696233618] [2022-04-08 08:48:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:26,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {48706#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48699#true} is VALID [2022-04-08 08:48:26,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {48699#true} assume true; {48699#true} is VALID [2022-04-08 08:48:26,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48699#true} {48699#true} #703#return; {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {48699#true} call ULTIMATE.init(); {48706#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {48706#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {48699#true} assume true; {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48699#true} {48699#true} #703#return; {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {48699#true} call #t~ret161 := main(); {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {48699#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {48699#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L272 TraceCheckUtils]: 7: Hoare triple {48699#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {48699#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {48699#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {48699#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {48699#true} is VALID [2022-04-08 08:48:26,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {48699#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {48699#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {48699#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {48699#true} assume !false; {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {48699#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {48699#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {48699#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {48699#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {48699#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {48699#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {48699#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {48699#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {48699#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {48699#true} assume 8464 == #t~mem55;havoc #t~mem55; {48699#true} is VALID [2022-04-08 08:48:26,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {48699#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {48699#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {48699#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {48699#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {48699#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {48699#true} ~skip~0 := 0; {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {48699#true} assume !false; {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {48699#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {48699#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {48699#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {48699#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {48699#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {48699#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {48699#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {48699#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {48699#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {48699#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {48699#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {48699#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {48699#true} assume 8496 == #t~mem58;havoc #t~mem58; {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {48699#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {48699#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48699#true} is VALID [2022-04-08 08:48:26,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {48699#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {48699#true} is VALID [2022-04-08 08:48:26,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {48699#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,437 INFO L290 TraceCheckUtils]: 65: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,438 INFO L290 TraceCheckUtils]: 68: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,438 INFO L290 TraceCheckUtils]: 70: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,439 INFO L290 TraceCheckUtils]: 71: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,440 INFO L290 TraceCheckUtils]: 73: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,440 INFO L290 TraceCheckUtils]: 74: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,440 INFO L290 TraceCheckUtils]: 75: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,441 INFO L290 TraceCheckUtils]: 76: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,441 INFO L290 TraceCheckUtils]: 79: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,442 INFO L290 TraceCheckUtils]: 80: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,442 INFO L290 TraceCheckUtils]: 81: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,443 INFO L290 TraceCheckUtils]: 83: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,443 INFO L290 TraceCheckUtils]: 84: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,444 INFO L290 TraceCheckUtils]: 85: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:26,444 INFO L290 TraceCheckUtils]: 86: Hoare triple {48704#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {48705#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-08 08:48:26,444 INFO L290 TraceCheckUtils]: 87: Hoare triple {48705#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {48700#false} is VALID [2022-04-08 08:48:26,444 INFO L290 TraceCheckUtils]: 88: Hoare triple {48700#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {48700#false} is VALID [2022-04-08 08:48:26,444 INFO L290 TraceCheckUtils]: 89: Hoare triple {48700#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {48700#false} is VALID [2022-04-08 08:48:26,444 INFO L290 TraceCheckUtils]: 90: Hoare triple {48700#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,444 INFO L290 TraceCheckUtils]: 91: Hoare triple {48700#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 92: Hoare triple {48700#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 93: Hoare triple {48700#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 94: Hoare triple {48700#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 95: Hoare triple {48700#false} ~skip~0 := 0; {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 96: Hoare triple {48700#false} assume !false; {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 97: Hoare triple {48700#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 98: Hoare triple {48700#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 99: Hoare triple {48700#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,445 INFO L290 TraceCheckUtils]: 100: Hoare triple {48700#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 101: Hoare triple {48700#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 102: Hoare triple {48700#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 103: Hoare triple {48700#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 104: Hoare triple {48700#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 105: Hoare triple {48700#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 106: Hoare triple {48700#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 107: Hoare triple {48700#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 108: Hoare triple {48700#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 109: Hoare triple {48700#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 110: Hoare triple {48700#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 111: Hoare triple {48700#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 112: Hoare triple {48700#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 113: Hoare triple {48700#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 114: Hoare triple {48700#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,446 INFO L290 TraceCheckUtils]: 115: Hoare triple {48700#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 116: Hoare triple {48700#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 117: Hoare triple {48700#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 118: Hoare triple {48700#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 119: Hoare triple {48700#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 120: Hoare triple {48700#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 121: Hoare triple {48700#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 122: Hoare triple {48700#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 123: Hoare triple {48700#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 124: Hoare triple {48700#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 125: Hoare triple {48700#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 126: Hoare triple {48700#false} assume 8640 == #t~mem75;havoc #t~mem75; {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 127: Hoare triple {48700#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {48700#false} is VALID [2022-04-08 08:48:26,447 INFO L290 TraceCheckUtils]: 128: Hoare triple {48700#false} assume !(4 == ~blastFlag~0); {48700#false} is VALID [2022-04-08 08:48:26,448 INFO L290 TraceCheckUtils]: 129: Hoare triple {48700#false} assume !(7 == ~blastFlag~0); {48700#false} is VALID [2022-04-08 08:48:26,448 INFO L290 TraceCheckUtils]: 130: Hoare triple {48700#false} assume !(10 == ~blastFlag~0); {48700#false} is VALID [2022-04-08 08:48:26,448 INFO L290 TraceCheckUtils]: 131: Hoare triple {48700#false} assume !false; {48700#false} is VALID [2022-04-08 08:48:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:48:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:26,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696233618] [2022-04-08 08:48:26,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696233618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:26,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:26,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:26,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:26,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718623713] [2022-04-08 08:48:26,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718623713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:26,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:26,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329177948] [2022-04-08 08:48:26,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 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 132 [2022-04-08 08:48:26,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:26,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:26,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:26,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:26,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:26,534 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:31,919 INFO L93 Difference]: Finished difference Result 859 states and 1315 transitions. [2022-04-08 08:48:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 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 132 [2022-04-08 08:48:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-08 08:48:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-08 08:48:31,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 598 transitions. [2022-04-08 08:48:32,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 598 edges. 598 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:32,292 INFO L225 Difference]: With dead ends: 859 [2022-04-08 08:48:32,292 INFO L226 Difference]: Without dead ends: 501 [2022-04-08 08:48:32,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:32,293 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 112 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:32,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 363 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:48:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-04-08 08:48:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 427. [2022-04-08 08:48:32,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:32,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 501 states. Second operand has 427 states, 422 states have (on average 1.5402843601895735) internal successors, (650), 422 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,313 INFO L74 IsIncluded]: Start isIncluded. First operand 501 states. Second operand has 427 states, 422 states have (on average 1.5402843601895735) internal successors, (650), 422 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,313 INFO L87 Difference]: Start difference. First operand 501 states. Second operand has 427 states, 422 states have (on average 1.5402843601895735) internal successors, (650), 422 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:32,321 INFO L93 Difference]: Finished difference Result 501 states and 757 transitions. [2022-04-08 08:48:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 757 transitions. [2022-04-08 08:48:32,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:32,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:32,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 427 states, 422 states have (on average 1.5402843601895735) internal successors, (650), 422 states have internal predecessors, (650), 3 states have call successors, (3), 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 501 states. [2022-04-08 08:48:32,323 INFO L87 Difference]: Start difference. First operand has 427 states, 422 states have (on average 1.5402843601895735) internal successors, (650), 422 states have internal predecessors, (650), 3 states have call successors, (3), 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 501 states. [2022-04-08 08:48:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:32,331 INFO L93 Difference]: Finished difference Result 501 states and 757 transitions. [2022-04-08 08:48:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 757 transitions. [2022-04-08 08:48:32,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:32,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:32,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:32,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 422 states have (on average 1.5402843601895735) internal successors, (650), 422 states have internal predecessors, (650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 654 transitions. [2022-04-08 08:48:32,341 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 654 transitions. Word has length 132 [2022-04-08 08:48:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:32,341 INFO L478 AbstractCegarLoop]: Abstraction has 427 states and 654 transitions. [2022-04-08 08:48:32,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 427 states and 654 transitions. [2022-04-08 08:48:32,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 654 edges. 654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 654 transitions. [2022-04-08 08:48:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 08:48:32,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:32,919 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:32,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:48:32,919 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1183075471, now seen corresponding path program 1 times [2022-04-08 08:48:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:32,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [541772726] [2022-04-08 08:48:32,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:32,993 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:32,993 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1183075471, now seen corresponding path program 2 times [2022-04-08 08:48:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:32,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197444788] [2022-04-08 08:48:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:33,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {52292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52285#true} is VALID [2022-04-08 08:48:33,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {52285#true} assume true; {52285#true} is VALID [2022-04-08 08:48:33,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52285#true} {52285#true} #703#return; {52285#true} is VALID [2022-04-08 08:48:33,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {52285#true} call ULTIMATE.init(); {52292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:33,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {52292#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52285#true} is VALID [2022-04-08 08:48:33,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {52285#true} assume true; {52285#true} is VALID [2022-04-08 08:48:33,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52285#true} {52285#true} #703#return; {52285#true} is VALID [2022-04-08 08:48:33,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {52285#true} call #t~ret161 := main(); {52285#true} is VALID [2022-04-08 08:48:33,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {52285#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {52285#true} is VALID [2022-04-08 08:48:33,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {52285#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L272 TraceCheckUtils]: 7: Hoare triple {52285#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {52285#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {52285#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {52285#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {52285#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {52285#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {52285#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {52285#true} assume !false; {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {52285#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {52285#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {52285#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {52285#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {52285#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {52285#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {52285#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {52285#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {52285#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {52285#true} assume 8464 == #t~mem55;havoc #t~mem55; {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {52285#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {52285#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {52285#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {52285#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {52285#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {52285#true} ~skip~0 := 0; {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {52285#true} assume !false; {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {52285#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {52285#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {52285#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {52285#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {52285#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {52285#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {52285#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {52285#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {52285#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {52285#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {52285#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {52285#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {52285#true} assume 8496 == #t~mem58;havoc #t~mem58; {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {52285#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {52285#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52285#true} is VALID [2022-04-08 08:48:33,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {52285#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {52285#true} is VALID [2022-04-08 08:48:33,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {52285#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,113 INFO L290 TraceCheckUtils]: 49: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,116 INFO L290 TraceCheckUtils]: 58: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,120 INFO L290 TraceCheckUtils]: 70: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,121 INFO L290 TraceCheckUtils]: 73: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,122 INFO L290 TraceCheckUtils]: 76: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,123 INFO L290 TraceCheckUtils]: 80: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,124 INFO L290 TraceCheckUtils]: 83: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:33,124 INFO L290 TraceCheckUtils]: 84: Hoare triple {52290#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {52291#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-08 08:48:33,124 INFO L290 TraceCheckUtils]: 85: Hoare triple {52291#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 86: Hoare triple {52286#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 87: Hoare triple {52286#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 88: Hoare triple {52286#false} assume 8673 == #t~mem80;havoc #t~mem80; {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 89: Hoare triple {52286#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 90: Hoare triple {52286#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 91: Hoare triple {52286#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 92: Hoare triple {52286#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 93: Hoare triple {52286#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 94: Hoare triple {52286#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 95: Hoare triple {52286#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 96: Hoare triple {52286#false} ~skip~0 := 0; {52286#false} is VALID [2022-04-08 08:48:33,125 INFO L290 TraceCheckUtils]: 97: Hoare triple {52286#false} assume !false; {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 98: Hoare triple {52286#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 99: Hoare triple {52286#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 100: Hoare triple {52286#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 101: Hoare triple {52286#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 102: Hoare triple {52286#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 103: Hoare triple {52286#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 104: Hoare triple {52286#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 105: Hoare triple {52286#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 106: Hoare triple {52286#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 107: Hoare triple {52286#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 108: Hoare triple {52286#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 109: Hoare triple {52286#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 110: Hoare triple {52286#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,126 INFO L290 TraceCheckUtils]: 111: Hoare triple {52286#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 112: Hoare triple {52286#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 113: Hoare triple {52286#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 114: Hoare triple {52286#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 115: Hoare triple {52286#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 116: Hoare triple {52286#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 117: Hoare triple {52286#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 118: Hoare triple {52286#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 119: Hoare triple {52286#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 120: Hoare triple {52286#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 121: Hoare triple {52286#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 122: Hoare triple {52286#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 123: Hoare triple {52286#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 124: Hoare triple {52286#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,127 INFO L290 TraceCheckUtils]: 125: Hoare triple {52286#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L290 TraceCheckUtils]: 126: Hoare triple {52286#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L290 TraceCheckUtils]: 127: Hoare triple {52286#false} assume 8640 == #t~mem75;havoc #t~mem75; {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L290 TraceCheckUtils]: 128: Hoare triple {52286#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L290 TraceCheckUtils]: 129: Hoare triple {52286#false} assume !(4 == ~blastFlag~0); {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L290 TraceCheckUtils]: 130: Hoare triple {52286#false} assume !(7 == ~blastFlag~0); {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L290 TraceCheckUtils]: 131: Hoare triple {52286#false} assume !(10 == ~blastFlag~0); {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L290 TraceCheckUtils]: 132: Hoare triple {52286#false} assume !false; {52286#false} is VALID [2022-04-08 08:48:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:48:33,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197444788] [2022-04-08 08:48:33,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197444788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:33,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:33,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:33,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:33,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [541772726] [2022-04-08 08:48:33,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [541772726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:33,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:33,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269087359] [2022-04-08 08:48:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 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 133 [2022-04-08 08:48:33,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:33,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:33,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:33,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:33,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:33,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:33,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:33,214 INFO L87 Difference]: Start difference. First operand 427 states and 654 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:36,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:42,185 INFO L93 Difference]: Finished difference Result 911 states and 1400 transitions. [2022-04-08 08:48:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:42,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 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 133 [2022-04-08 08:48:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-08 08:48:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-08 08:48:42,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-08 08:48:42,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:42,528 INFO L225 Difference]: With dead ends: 911 [2022-04-08 08:48:42,528 INFO L226 Difference]: Without dead ends: 510 [2022-04-08 08:48:42,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:42,529 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 60 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:42,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 499 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 500 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-08 08:48:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-04-08 08:48:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 470. [2022-04-08 08:48:42,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:42,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 510 states. Second operand has 470 states, 465 states have (on average 1.5397849462365591) internal successors, (716), 465 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:42,552 INFO L74 IsIncluded]: Start isIncluded. First operand 510 states. Second operand has 470 states, 465 states have (on average 1.5397849462365591) internal successors, (716), 465 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:42,553 INFO L87 Difference]: Start difference. First operand 510 states. Second operand has 470 states, 465 states have (on average 1.5397849462365591) internal successors, (716), 465 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:42,561 INFO L93 Difference]: Finished difference Result 510 states and 774 transitions. [2022-04-08 08:48:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 774 transitions. [2022-04-08 08:48:42,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:42,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:42,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 465 states have (on average 1.5397849462365591) internal successors, (716), 465 states have internal predecessors, (716), 3 states have call successors, (3), 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 510 states. [2022-04-08 08:48:42,563 INFO L87 Difference]: Start difference. First operand has 470 states, 465 states have (on average 1.5397849462365591) internal successors, (716), 465 states have internal predecessors, (716), 3 states have call successors, (3), 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 510 states. [2022-04-08 08:48:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:42,571 INFO L93 Difference]: Finished difference Result 510 states and 774 transitions. [2022-04-08 08:48:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 774 transitions. [2022-04-08 08:48:42,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:42,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:42,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:42,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 465 states have (on average 1.5397849462365591) internal successors, (716), 465 states have internal predecessors, (716), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 720 transitions. [2022-04-08 08:48:42,582 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 720 transitions. Word has length 133 [2022-04-08 08:48:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:42,582 INFO L478 AbstractCegarLoop]: Abstraction has 470 states and 720 transitions. [2022-04-08 08:48:42,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:42,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 470 states and 720 transitions. [2022-04-08 08:48:43,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 720 transitions. [2022-04-08 08:48:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 08:48:43,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:43,232 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:43,233 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:48:43,233 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash 693407347, now seen corresponding path program 1 times [2022-04-08 08:48:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:43,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320787806] [2022-04-08 08:48:43,302 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:43,303 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:43,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 693407347, now seen corresponding path program 2 times [2022-04-08 08:48:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:43,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937376566] [2022-04-08 08:48:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:43,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:43,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {56086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56079#true} is VALID [2022-04-08 08:48:43,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {56079#true} assume true; {56079#true} is VALID [2022-04-08 08:48:43,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56079#true} {56079#true} #703#return; {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {56079#true} call ULTIMATE.init(); {56086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:43,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {56086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {56079#true} assume true; {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56079#true} {56079#true} #703#return; {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {56079#true} call #t~ret161 := main(); {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {56079#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {56079#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L272 TraceCheckUtils]: 7: Hoare triple {56079#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {56079#true} is VALID [2022-04-08 08:48:43,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {56079#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {56079#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {56079#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {56079#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {56079#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {56079#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {56079#true} assume !false; {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {56079#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {56079#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {56079#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {56079#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {56079#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {56079#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {56079#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {56079#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {56079#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {56079#true} assume 8464 == #t~mem55;havoc #t~mem55; {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {56079#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {56079#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {56079#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {56079#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {56079#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {56079#true} ~skip~0 := 0; {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {56079#true} assume !false; {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {56079#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {56079#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {56079#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {56079#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {56079#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {56079#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {56079#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {56079#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {56079#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {56079#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {56079#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {56079#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {56079#true} assume 8496 == #t~mem58;havoc #t~mem58; {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {56079#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {56079#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {56079#true} is VALID [2022-04-08 08:48:43,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {56079#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {56079#true} is VALID [2022-04-08 08:48:43,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {56079#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,433 INFO L290 TraceCheckUtils]: 59: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {56084#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56085#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 68: Hoare triple {56085#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 69: Hoare triple {56080#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 70: Hoare triple {56080#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 71: Hoare triple {56080#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 72: Hoare triple {56080#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 73: Hoare triple {56080#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 74: Hoare triple {56080#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 75: Hoare triple {56080#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {56080#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,436 INFO L290 TraceCheckUtils]: 77: Hoare triple {56080#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {56080#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 79: Hoare triple {56080#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 80: Hoare triple {56080#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {56080#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 82: Hoare triple {56080#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 83: Hoare triple {56080#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 84: Hoare triple {56080#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 85: Hoare triple {56080#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 86: Hoare triple {56080#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 87: Hoare triple {56080#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 88: Hoare triple {56080#false} assume 8673 == #t~mem80;havoc #t~mem80; {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 89: Hoare triple {56080#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 90: Hoare triple {56080#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {56080#false} is VALID [2022-04-08 08:48:43,437 INFO L290 TraceCheckUtils]: 91: Hoare triple {56080#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 92: Hoare triple {56080#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 93: Hoare triple {56080#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 94: Hoare triple {56080#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 95: Hoare triple {56080#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 96: Hoare triple {56080#false} ~skip~0 := 0; {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 97: Hoare triple {56080#false} assume !false; {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 98: Hoare triple {56080#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 99: Hoare triple {56080#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 100: Hoare triple {56080#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 101: Hoare triple {56080#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 102: Hoare triple {56080#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 103: Hoare triple {56080#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 104: Hoare triple {56080#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 105: Hoare triple {56080#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,438 INFO L290 TraceCheckUtils]: 106: Hoare triple {56080#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 107: Hoare triple {56080#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 108: Hoare triple {56080#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 109: Hoare triple {56080#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 110: Hoare triple {56080#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 111: Hoare triple {56080#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 112: Hoare triple {56080#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 113: Hoare triple {56080#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 114: Hoare triple {56080#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 115: Hoare triple {56080#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 116: Hoare triple {56080#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 117: Hoare triple {56080#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 118: Hoare triple {56080#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 119: Hoare triple {56080#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,439 INFO L290 TraceCheckUtils]: 120: Hoare triple {56080#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 121: Hoare triple {56080#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 122: Hoare triple {56080#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 123: Hoare triple {56080#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 124: Hoare triple {56080#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 125: Hoare triple {56080#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 126: Hoare triple {56080#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 127: Hoare triple {56080#false} assume 8640 == #t~mem75;havoc #t~mem75; {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 128: Hoare triple {56080#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 129: Hoare triple {56080#false} assume !(4 == ~blastFlag~0); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 130: Hoare triple {56080#false} assume !(7 == ~blastFlag~0); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 131: Hoare triple {56080#false} assume !(10 == ~blastFlag~0); {56080#false} is VALID [2022-04-08 08:48:43,440 INFO L290 TraceCheckUtils]: 132: Hoare triple {56080#false} assume !false; {56080#false} is VALID [2022-04-08 08:48:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 08:48:43,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937376566] [2022-04-08 08:48:43,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937376566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:43,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:43,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:43,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:43,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320787806] [2022-04-08 08:48:43,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320787806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:43,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:43,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473080515] [2022-04-08 08:48:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:43,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 133 [2022-04-08 08:48:43,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:43,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:43,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:43,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:43,515 INFO L87 Difference]: Start difference. First operand 470 states and 720 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:49,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:51,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:52,387 INFO L93 Difference]: Finished difference Result 959 states and 1475 transitions. [2022-04-08 08:48:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:52,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 133 [2022-04-08 08:48:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-08 08:48:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-08 08:48:52,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 487 transitions. [2022-04-08 08:48:52,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:52,686 INFO L225 Difference]: With dead ends: 959 [2022-04-08 08:48:52,687 INFO L226 Difference]: Without dead ends: 515 [2022-04-08 08:48:52,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:52,688 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 33 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:52,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 613 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 08:48:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-08 08:48:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 494. [2022-04-08 08:48:52,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:52,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 494 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 489 states have internal predecessors, (751), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:52,712 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 494 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 489 states have internal predecessors, (751), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:52,712 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 494 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 489 states have internal predecessors, (751), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:52,721 INFO L93 Difference]: Finished difference Result 515 states and 783 transitions. [2022-04-08 08:48:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 783 transitions. [2022-04-08 08:48:52,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:52,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:52,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 489 states have internal predecessors, (751), 3 states have call successors, (3), 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 515 states. [2022-04-08 08:48:52,730 INFO L87 Difference]: Start difference. First operand has 494 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 489 states have internal predecessors, (751), 3 states have call successors, (3), 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 515 states. [2022-04-08 08:48:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:52,738 INFO L93 Difference]: Finished difference Result 515 states and 783 transitions. [2022-04-08 08:48:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 783 transitions. [2022-04-08 08:48:52,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:52,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:52,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:52,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 489 states have internal predecessors, (751), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 755 transitions. [2022-04-08 08:48:52,750 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 755 transitions. Word has length 133 [2022-04-08 08:48:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:52,750 INFO L478 AbstractCegarLoop]: Abstraction has 494 states and 755 transitions. [2022-04-08 08:48:52,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:52,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 494 states and 755 transitions. [2022-04-08 08:48:53,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 755 edges. 755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 755 transitions. [2022-04-08 08:48:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 08:48:53,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:53,384 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1] [2022-04-08 08:48:53,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 08:48:53,391 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash 930502973, now seen corresponding path program 1 times [2022-04-08 08:48:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:53,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685037442] [2022-04-08 08:48:53,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:53,465 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:53,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash 930502973, now seen corresponding path program 2 times [2022-04-08 08:48:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:53,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538064930] [2022-04-08 08:48:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:53,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {60034#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {60027#true} is VALID [2022-04-08 08:48:53,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {60027#true} assume true; {60027#true} is VALID [2022-04-08 08:48:53,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60027#true} {60027#true} #703#return; {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {60027#true} call ULTIMATE.init(); {60034#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:53,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {60034#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_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_server_data~0.base, ~#SSLv3_server_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_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {60027#true} assume true; {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60027#true} {60027#true} #703#return; {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {60027#true} call #t~ret161 := main(); {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {60027#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;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~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {60027#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L272 TraceCheckUtils]: 7: Hoare triple {60027#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {60027#true} is VALID [2022-04-08 08:48:53,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {60027#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {60027#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {60027#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {60027#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {60027#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {60027#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {60027#true} assume !false; {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {60027#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {60027#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {60027#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {60027#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {60027#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {60027#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {60027#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {60027#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {60027#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {60027#true} assume 8464 == #t~mem55;havoc #t~mem55; {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {60027#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {60027#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {60027#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {60027#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {60027#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {60027#true} ~skip~0 := 0; {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {60027#true} assume !false; {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {60027#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {60027#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {60027#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {60027#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {60027#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {60027#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {60027#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {60027#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {60027#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {60027#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {60027#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {60027#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {60027#true} assume 8496 == #t~mem58;havoc #t~mem58; {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {60027#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {60027#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {60027#true} is VALID [2022-04-08 08:48:53,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {60027#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {60027#true} is VALID [2022-04-08 08:48:53,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {60027#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,594 INFO L290 TraceCheckUtils]: 50: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,601 INFO L290 TraceCheckUtils]: 72: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 73: Hoare triple {60032#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60033#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 74: Hoare triple {60033#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {60028#false} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 75: Hoare triple {60028#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {60028#false} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 76: Hoare triple {60028#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 77: Hoare triple {60028#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 78: Hoare triple {60028#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60028#false} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 79: Hoare triple {60028#false} ~skip~0 := 0; {60028#false} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 80: Hoare triple {60028#false} assume !false; {60028#false} is VALID [2022-04-08 08:48:53,602 INFO L290 TraceCheckUtils]: 81: Hoare triple {60028#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 82: Hoare triple {60028#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 83: Hoare triple {60028#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 84: Hoare triple {60028#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 85: Hoare triple {60028#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 86: Hoare triple {60028#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 87: Hoare triple {60028#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 88: Hoare triple {60028#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 89: Hoare triple {60028#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 90: Hoare triple {60028#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 91: Hoare triple {60028#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 92: Hoare triple {60028#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 93: Hoare triple {60028#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 94: Hoare triple {60028#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,603 INFO L290 TraceCheckUtils]: 95: Hoare triple {60028#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 96: Hoare triple {60028#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 97: Hoare triple {60028#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 98: Hoare triple {60028#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 99: Hoare triple {60028#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 100: Hoare triple {60028#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 101: Hoare triple {60028#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 102: Hoare triple {60028#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 103: Hoare triple {60028#false} assume 8448 == #t~mem68;havoc #t~mem68; {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 104: Hoare triple {60028#false} assume !(~num1~0 > 0); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 105: Hoare triple {60028#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 106: Hoare triple {60028#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 107: Hoare triple {60028#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 108: Hoare triple {60028#false} ~skip~0 := 0; {60028#false} is VALID [2022-04-08 08:48:53,604 INFO L290 TraceCheckUtils]: 109: Hoare triple {60028#false} assume !false; {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 110: Hoare triple {60028#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 111: Hoare triple {60028#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 112: Hoare triple {60028#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 113: Hoare triple {60028#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 114: Hoare triple {60028#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 115: Hoare triple {60028#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 116: Hoare triple {60028#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 117: Hoare triple {60028#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 118: Hoare triple {60028#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 119: Hoare triple {60028#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 120: Hoare triple {60028#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 121: Hoare triple {60028#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 122: Hoare triple {60028#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 123: Hoare triple {60028#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,605 INFO L290 TraceCheckUtils]: 124: Hoare triple {60028#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 125: Hoare triple {60028#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 126: Hoare triple {60028#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 127: Hoare triple {60028#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 128: Hoare triple {60028#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 129: Hoare triple {60028#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 130: Hoare triple {60028#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 131: Hoare triple {60028#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 132: Hoare triple {60028#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 133: Hoare triple {60028#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 134: Hoare triple {60028#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 135: Hoare triple {60028#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 136: Hoare triple {60028#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 137: Hoare triple {60028#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,606 INFO L290 TraceCheckUtils]: 138: Hoare triple {60028#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {60028#false} is VALID [2022-04-08 08:48:53,607 INFO L290 TraceCheckUtils]: 139: Hoare triple {60028#false} assume 8640 == #t~mem75;havoc #t~mem75; {60028#false} is VALID [2022-04-08 08:48:53,607 INFO L290 TraceCheckUtils]: 140: Hoare triple {60028#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {60028#false} is VALID [2022-04-08 08:48:53,607 INFO L290 TraceCheckUtils]: 141: Hoare triple {60028#false} assume !(4 == ~blastFlag~0); {60028#false} is VALID [2022-04-08 08:48:53,607 INFO L290 TraceCheckUtils]: 142: Hoare triple {60028#false} assume !(7 == ~blastFlag~0); {60028#false} is VALID [2022-04-08 08:48:53,607 INFO L290 TraceCheckUtils]: 143: Hoare triple {60028#false} assume !(10 == ~blastFlag~0); {60028#false} is VALID [2022-04-08 08:48:53,607 INFO L290 TraceCheckUtils]: 144: Hoare triple {60028#false} assume !false; {60028#false} is VALID [2022-04-08 08:48:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:48:53,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:53,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538064930] [2022-04-08 08:48:53,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538064930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:53,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:53,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:53,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:53,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1685037442] [2022-04-08 08:48:53,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1685037442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:53,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:53,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004446725] [2022-04-08 08:48:53,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 145 [2022-04-08 08:48:53,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:53,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:53,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:53,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:53,686 INFO L87 Difference]: Start difference. First operand 494 states and 755 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:55,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:02,528 INFO L93 Difference]: Finished difference Result 1082 states and 1658 transitions. [2022-04-08 08:49:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 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 145 [2022-04-08 08:49:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-08 08:49:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-04-08 08:49:02,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 598 transitions. [2022-04-08 08:49:02,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 598 edges. 598 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:02,913 INFO L225 Difference]: With dead ends: 1082 [2022-04-08 08:49:02,914 INFO L226 Difference]: Without dead ends: 614 [2022-04-08 08:49:02,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:02,915 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 126 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:02,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 386 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:49:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-04-08 08:49:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 524. [2022-04-08 08:49:02,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:02,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 614 states. Second operand has 524 states, 519 states have (on average 1.5260115606936415) internal successors, (792), 519 states have internal predecessors, (792), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:02,944 INFO L74 IsIncluded]: Start isIncluded. First operand 614 states. Second operand has 524 states, 519 states have (on average 1.5260115606936415) internal successors, (792), 519 states have internal predecessors, (792), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:02,944 INFO L87 Difference]: Start difference. First operand 614 states. Second operand has 524 states, 519 states have (on average 1.5260115606936415) internal successors, (792), 519 states have internal predecessors, (792), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:02,962 INFO L93 Difference]: Finished difference Result 614 states and 925 transitions. [2022-04-08 08:49:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 925 transitions. [2022-04-08 08:49:02,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:02,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:02,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 524 states, 519 states have (on average 1.5260115606936415) internal successors, (792), 519 states have internal predecessors, (792), 3 states have call successors, (3), 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 614 states. [2022-04-08 08:49:02,964 INFO L87 Difference]: Start difference. First operand has 524 states, 519 states have (on average 1.5260115606936415) internal successors, (792), 519 states have internal predecessors, (792), 3 states have call successors, (3), 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 614 states. [2022-04-08 08:49:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:02,975 INFO L93 Difference]: Finished difference Result 614 states and 925 transitions. [2022-04-08 08:49:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 925 transitions. [2022-04-08 08:49:02,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:02,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:02,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:02,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 519 states have (on average 1.5260115606936415) internal successors, (792), 519 states have internal predecessors, (792), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 796 transitions. [2022-04-08 08:49:02,988 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 796 transitions. Word has length 145 [2022-04-08 08:49:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:02,988 INFO L478 AbstractCegarLoop]: Abstraction has 524 states and 796 transitions. [2022-04-08 08:49:02,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:02,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 524 states and 796 transitions. [2022-04-08 08:49:03,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 796 edges. 796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 796 transitions. [2022-04-08 08:49:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-08 08:49:03,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:03,659 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:03,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 08:49:03,659 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1249342093, now seen corresponding path program 1 times [2022-04-08 08:49:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:03,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1815935580] [2022-04-08 08:49:03,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:49:03,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:03,855 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:03,856 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:49:03,859 INFO L158 Benchmark]: Toolchain (without parser) took 238744.97ms. Allocated memory was 195.0MB in the beginning and 282.1MB in the end (delta: 87.0MB). Free memory was 142.8MB in the beginning and 237.6MB in the end (delta: -94.8MB). Peak memory consumption was 151.6MB. Max. memory is 8.0GB. [2022-04-08 08:49:03,859 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory was 161.7MB in the beginning and 161.6MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:49:03,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.64ms. Allocated memory is still 195.0MB. Free memory was 142.7MB in the beginning and 147.5MB in the end (delta: -4.8MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-08 08:49:03,859 INFO L158 Benchmark]: Boogie Preprocessor took 119.33ms. Allocated memory is still 195.0MB. Free memory was 147.5MB in the beginning and 137.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:49:03,861 INFO L158 Benchmark]: RCFGBuilder took 1679.64ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 137.2MB in the beginning and 141.6MB in the end (delta: -4.4MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. [2022-04-08 08:49:03,861 INFO L158 Benchmark]: TraceAbstraction took 236475.83ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 141.1MB in the beginning and 237.6MB in the end (delta: -96.5MB). Peak memory consumption was 109.0MB. Max. memory is 8.0GB. [2022-04-08 08:49:03,866 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 195.0MB. Free memory was 161.7MB in the beginning and 161.6MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.64ms. Allocated memory is still 195.0MB. Free memory was 142.7MB in the beginning and 147.5MB in the end (delta: -4.8MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 119.33ms. Allocated memory is still 195.0MB. Free memory was 147.5MB in the beginning and 137.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1679.64ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 137.2MB in the beginning and 141.6MB in the end (delta: -4.4MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. * TraceAbstraction took 236475.83ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 141.1MB in the beginning and 237.6MB in the end (delta: -96.5MB). Peak memory consumption was 109.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:49:03,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...