/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:13:01,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:13:01,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:13:01,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:13:01,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:13:01,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:13:01,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:13:01,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:13:01,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:13:01,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:13:01,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:13:01,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:13:01,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:13:01,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:13:01,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:13:01,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:13:01,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:13:01,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:13:01,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:13:01,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:13:01,775 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:13:01,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:13:01,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:13:01,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:13:01,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:13:01,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:13:01,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:13:01,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:13:01,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:13:01,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:13:01,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:13:01,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:13:01,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:13:01,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:13:01,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:13:01,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:13:01,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:13:01,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:13:01,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:13:01,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:13:01,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:13:01,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:13:01,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 15:13:01,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:13:01,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:13:01,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:13:01,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:13:01,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:13:01,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:13:01,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:13:01,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:13:01,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:13:01,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:13:01,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:13:01,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:13:01,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:13:01,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:13:01,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:13:01,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:13:01,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:13:01,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:13:01,811 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:13:01,811 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:13:01,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:13:01,812 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:13:01,812 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 15:13:02,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:13:02,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:13:02,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:13:02,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:13:02,049 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:13:02,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-08 15:13:02,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a9234fc/6f693d43f8714931bfc7606f2e044a71/FLAG9566889ba [2022-04-08 15:13:02,607 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:13:02,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c [2022-04-08 15:13:02,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a9234fc/6f693d43f8714931bfc7606f2e044a71/FLAG9566889ba [2022-04-08 15:13:02,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a9234fc/6f693d43f8714931bfc7606f2e044a71 [2022-04-08 15:13:02,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:13:02,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:13:02,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:13:02,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:13:02,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:13:02,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:13:02" (1/1) ... [2022-04-08 15:13:02,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af01fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:02, skipping insertion in model container [2022-04-08 15:13:02,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:13:02" (1/1) ... [2022-04-08 15:13:02,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:13:02,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:13:03,302 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.01.i.cil-2.c[72913,72926] [2022-04-08 15:13:03,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:13:03,322 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:13:03,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-04-08 15:13:03,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:13:03,508 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:13:03,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03 WrapperNode [2022-04-08 15:13:03,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:13:03,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:13:03,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:13:03,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:13:03,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:13:03,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:13:03,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:13:03,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:13:03,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (1/1) ... [2022-04-08 15:13:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:13:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:13:03,683 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 15:13:03,685 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 15:13:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:13:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:13:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:13:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 15:13:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 15:13:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:13:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 15:13:03,715 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:13:03,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:13:03,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:13:03,715 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:13:03,715 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:13:03,716 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:13:03,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:13:03,716 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:13:03,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 15:13:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:13:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:13:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:13:03,856 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:13:03,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:13:05,623 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:13:06,177 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 15:13:06,177 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 15:13:06,191 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:13:06,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:13:06,199 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:13:06,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:13:06 BoogieIcfgContainer [2022-04-08 15:13:06,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:13:06,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:13:06,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:13:06,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:13:06,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:13:02" (1/3) ... [2022-04-08 15:13:06,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e1397b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:13:06, skipping insertion in model container [2022-04-08 15:13:06,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:13:03" (2/3) ... [2022-04-08 15:13:06,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e1397b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:13:06, skipping insertion in model container [2022-04-08 15:13:06,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:13:06" (3/3) ... [2022-04-08 15:13:06,207 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-04-08 15:13:06,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:13:06,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:13:06,247 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:13:06,253 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 15:13:06,253 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:13:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 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 15:13:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 15:13:06,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:06,283 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, 1, 1] [2022-04-08 15:13:06,283 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 1 times [2022-04-08 15:13:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:06,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474763954] [2022-04-08 15:13:06,304 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:13:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash 740864289, now seen corresponding path program 2 times [2022-04-08 15:13:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:06,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789960190] [2022-04-08 15:13:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:06,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {158#true} is VALID [2022-04-08 15:13:06,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-08 15:13:06,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-08 15:13:06,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {165#(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 15:13:06,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {158#true} is VALID [2022-04-08 15:13:06,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2022-04-08 15:13:06,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #664#return; {158#true} is VALID [2022-04-08 15:13:06,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret162 := main(); {158#true} is VALID [2022-04-08 15:13:06,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158#true} is VALID [2022-04-08 15:13:06,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {158#true} is VALID [2022-04-08 15:13:06,867 INFO L272 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158#true} is VALID [2022-04-08 15:13:06,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:06,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {164#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 15:13:06,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {164#(= 8464 |ssl3_accept_#t~mem50|)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {159#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {159#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {159#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {159#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {159#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {159#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {159#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {159#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {159#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {159#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {159#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {159#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {159#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {159#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {159#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {159#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {159#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {159#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {159#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {159#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {159#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {159#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {159#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {159#false} is VALID [2022-04-08 15:13:06,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} assume 8672 == #t~mem74;havoc #t~mem74; {159#false} is VALID [2022-04-08 15:13:06,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {159#false} is VALID [2022-04-08 15:13:06,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume 4 == ~blastFlag~0; {159#false} is VALID [2022-04-08 15:13:06,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-04-08 15:13:06,889 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 15:13:06,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789960190] [2022-04-08 15:13:06,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789960190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:06,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:06,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:06,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474763954] [2022-04-08 15:13:06,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474763954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:06,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:06,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463946901] [2022-04-08 15:13:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:06,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 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 52 [2022-04-08 15:13:06,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:06,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:06,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:06,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:06,979 INFO L87 Difference]: Start difference. First operand has 155 states, 147 states have (on average 1.6870748299319729) internal successors, (248), 148 states have internal predecessors, (248), 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.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:09,029 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 15:13:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:10,743 INFO L93 Difference]: Finished difference Result 328 states and 543 transitions. [2022-04-08 15:13:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 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 52 [2022-04-08 15:13:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-08 15:13:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2022-04-08 15:13:10,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 543 transitions. [2022-04-08 15:13:11,246 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 15:13:11,260 INFO L225 Difference]: With dead ends: 328 [2022-04-08 15:13:11,260 INFO L226 Difference]: Without dead ends: 167 [2022-04-08 15:13:11,262 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 15:13:11,265 INFO L913 BasicCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:11,265 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 583 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 15:13:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-08 15:13:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-08 15:13:11,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:11,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:11,308 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:11,309 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:11,317 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-08 15:13:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-08 15:13:11,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:11,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:11,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 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 167 states. [2022-04-08 15:13:11,320 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 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 167 states. [2022-04-08 15:13:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:11,327 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-04-08 15:13:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2022-04-08 15:13:11,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:11,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:11,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:11,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 145 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2022-04-08 15:13:11,338 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 52 [2022-04-08 15:13:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:11,339 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2022-04-08 15:13:11,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:11,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 227 transitions. [2022-04-08 15:13:11,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2022-04-08 15:13:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 15:13:11,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:11,537 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, 1, 1] [2022-04-08 15:13:11,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:13:11,537 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:11,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 1 times [2022-04-08 15:13:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:11,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539710573] [2022-04-08 15:13:11,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:11,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash -444444622, now seen corresponding path program 2 times [2022-04-08 15:13:11,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:11,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325939655] [2022-04-08 15:13:11,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:11,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {1467#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {1460#true} is VALID [2022-04-08 15:13:11,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-08 15:13:11,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-08 15:13:11,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1467#(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 15:13:11,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1467#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {1460#true} is VALID [2022-04-08 15:13:11,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {1460#true} assume true; {1460#true} is VALID [2022-04-08 15:13:11,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1460#true} {1460#true} #664#return; {1460#true} is VALID [2022-04-08 15:13:11,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {1460#true} call #t~ret162 := main(); {1460#true} is VALID [2022-04-08 15:13:11,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {1460#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1460#true} is VALID [2022-04-08 15:13:11,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {1460#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1460#true} is VALID [2022-04-08 15:13:11,819 INFO L272 TraceCheckUtils]: 7: Hoare triple {1460#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1460#true} is VALID [2022-04-08 15:13:11,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:11,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1466#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 15:13:11,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#(= 8464 |ssl3_accept_#t~mem47|)} assume 8480 == #t~mem47;havoc #t~mem47; {1461#false} is VALID [2022-04-08 15:13:11,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {1461#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {1461#false} is VALID [2022-04-08 15:13:11,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {1461#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {1461#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {1461#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {1461#false} is VALID [2022-04-08 15:13:11,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#false} ~skip~0 := 0; {1461#false} is VALID [2022-04-08 15:13:11,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-08 15:13:11,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {1461#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {1461#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {1461#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {1461#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {1461#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {1461#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {1461#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {1461#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {1461#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {1461#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {1461#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {1461#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {1461#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {1461#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {1461#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {1461#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {1461#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {1461#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {1461#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {1461#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {1461#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,841 INFO L290 TraceCheckUtils]: 55: Hoare triple {1461#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {1461#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {1461#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {1461#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {1461#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,844 INFO L290 TraceCheckUtils]: 60: Hoare triple {1461#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1461#false} is VALID [2022-04-08 15:13:11,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {1461#false} assume 8672 == #t~mem74;havoc #t~mem74; {1461#false} is VALID [2022-04-08 15:13:11,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {1461#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {1461#false} is VALID [2022-04-08 15:13:11,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {1461#false} assume 4 == ~blastFlag~0; {1461#false} is VALID [2022-04-08 15:13:11,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-08 15:13:11,854 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 15:13:11,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:11,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325939655] [2022-04-08 15:13:11,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325939655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:11,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:11,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:11,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:11,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539710573] [2022-04-08 15:13:11,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539710573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:11,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:11,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852852605] [2022-04-08 15:13:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:11,857 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 15:13:11,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:11,857 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 15:13:11,910 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 15:13:11,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:11,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:11,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:11,911 INFO L87 Difference]: Start difference. First operand 150 states and 227 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 15:13:13,943 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 15:13:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:15,062 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2022-04-08 15:13:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:15,062 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 15:13:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:15,062 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 15:13:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-08 15:13:15,068 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 15:13:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2022-04-08 15:13:15,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 437 transitions. [2022-04-08 15:13:15,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:15,437 INFO L225 Difference]: With dead ends: 291 [2022-04-08 15:13:15,437 INFO L226 Difference]: Without dead ends: 167 [2022-04-08 15:13:15,438 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 15:13:15,439 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:15,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 462 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-08 15:13:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2022-04-08 15:13:15,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:15,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:15,451 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:15,451 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:15,459 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-08 15:13:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-08 15:13:15,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:15,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:15,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 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 167 states. [2022-04-08 15:13:15,462 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 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 167 states. [2022-04-08 15:13:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:15,470 INFO L93 Difference]: Finished difference Result 167 states and 247 transitions. [2022-04-08 15:13:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-04-08 15:13:15,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:15,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:15,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:15,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 145 states have internal predecessors, (222), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2022-04-08 15:13:15,478 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 65 [2022-04-08 15:13:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:15,479 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2022-04-08 15:13:15,479 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 15:13:15,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 226 transitions. [2022-04-08 15:13:15,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2022-04-08 15:13:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:13:15,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:15,670 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, 1, 1] [2022-04-08 15:13:15,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:13:15,670 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 1 times [2022-04-08 15:13:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:15,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1460405158] [2022-04-08 15:13:15,704 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:15,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 795477037, now seen corresponding path program 2 times [2022-04-08 15:13:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:15,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888950985] [2022-04-08 15:13:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:15,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {2695#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {2688#true} is VALID [2022-04-08 15:13:15,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-08 15:13:15,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-08 15:13:15,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {2688#true} call ULTIMATE.init(); {2695#(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 15:13:15,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {2695#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {2688#true} is VALID [2022-04-08 15:13:15,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {2688#true} assume true; {2688#true} is VALID [2022-04-08 15:13:15,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2688#true} {2688#true} #664#return; {2688#true} is VALID [2022-04-08 15:13:15,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {2688#true} call #t~ret162 := main(); {2688#true} is VALID [2022-04-08 15:13:15,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {2688#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2688#true} is VALID [2022-04-08 15:13:15,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {2688#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2688#true} is VALID [2022-04-08 15:13:15,907 INFO L272 TraceCheckUtils]: 7: Hoare triple {2688#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2688#true} is VALID [2022-04-08 15:13:15,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {2688#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:15,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {2693#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2694#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-08 15:13:15,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {2694#(= 8464 |ssl3_accept_#t~mem48|)} assume 8481 == #t~mem48;havoc #t~mem48; {2689#false} is VALID [2022-04-08 15:13:15,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {2689#false} is VALID [2022-04-08 15:13:15,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {2689#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {2689#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {2689#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {2689#false} is VALID [2022-04-08 15:13:15,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {2689#false} ~skip~0 := 0; {2689#false} is VALID [2022-04-08 15:13:15,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-08 15:13:15,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {2689#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {2689#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {2689#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {2689#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {2689#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {2689#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {2689#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {2689#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {2689#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {2689#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {2689#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {2689#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {2689#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {2689#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {2689#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {2689#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {2689#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {2689#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {2689#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {2689#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {2689#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {2689#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {2689#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {2689#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {2689#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {2689#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {2689#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {2689#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {2689#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {2689#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {2689#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,940 INFO L290 TraceCheckUtils]: 60: Hoare triple {2689#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {2689#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2689#false} is VALID [2022-04-08 15:13:15,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {2689#false} assume 8672 == #t~mem74;havoc #t~mem74; {2689#false} is VALID [2022-04-08 15:13:15,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {2689#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {2689#false} is VALID [2022-04-08 15:13:15,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {2689#false} assume 4 == ~blastFlag~0; {2689#false} is VALID [2022-04-08 15:13:15,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {2689#false} assume !false; {2689#false} is VALID [2022-04-08 15:13:15,941 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 15:13:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:15,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888950985] [2022-04-08 15:13:15,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888950985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:15,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:15,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:15,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:15,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1460405158] [2022-04-08 15:13:15,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1460405158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:15,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:15,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785346492] [2022-04-08 15:13:15,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:15,943 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 15:13:15,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:15,950 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 15:13:16,010 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 15:13:16,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:16,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:16,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:16,015 INFO L87 Difference]: Start difference. First operand 150 states and 226 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 15:13:18,041 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 15:13:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:19,006 INFO L93 Difference]: Finished difference Result 289 states and 434 transitions. [2022-04-08 15:13:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:19,006 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 15:13:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:19,007 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 15:13:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-08 15:13:19,011 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 15:13:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-08 15:13:19,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-08 15:13:19,349 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 15:13:19,351 INFO L225 Difference]: With dead ends: 289 [2022-04-08 15:13:19,352 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 15:13:19,352 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 15:13:19,353 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 22 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:19,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 466 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:13:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 15:13:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 150. [2022-04-08 15:13:19,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:19,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:19,363 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:19,364 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:19,368 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-08 15:13:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-08 15:13:19,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:19,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:19,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 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 165 states. [2022-04-08 15:13:19,370 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 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 165 states. [2022-04-08 15:13:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:19,374 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-08 15:13:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-08 15:13:19,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:19,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:19,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:19,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5241379310344827) internal successors, (221), 145 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2022-04-08 15:13:19,380 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 66 [2022-04-08 15:13:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:19,380 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2022-04-08 15:13:19,380 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 15:13:19,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 225 transitions. [2022-04-08 15:13:19,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2022-04-08 15:13:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:13:19,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:19,542 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, 1, 1] [2022-04-08 15:13:19,542 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:13:19,542 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:19,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 1 times [2022-04-08 15:13:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:19,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91836394] [2022-04-08 15:13:19,557 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:19,557 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash -498657998, now seen corresponding path program 2 times [2022-04-08 15:13:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:19,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330865257] [2022-04-08 15:13:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:19,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {3915#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {3908#true} is VALID [2022-04-08 15:13:19,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {3908#true} assume true; {3908#true} is VALID [2022-04-08 15:13:19,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3908#true} {3908#true} #664#return; {3908#true} is VALID [2022-04-08 15:13:19,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {3908#true} call ULTIMATE.init(); {3915#(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 15:13:19,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {3915#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {3908#true} is VALID [2022-04-08 15:13:19,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {3908#true} assume true; {3908#true} is VALID [2022-04-08 15:13:19,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3908#true} {3908#true} #664#return; {3908#true} is VALID [2022-04-08 15:13:19,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {3908#true} call #t~ret162 := main(); {3908#true} is VALID [2022-04-08 15:13:19,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {3908#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3908#true} is VALID [2022-04-08 15:13:19,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {3908#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3908#true} is VALID [2022-04-08 15:13:19,723 INFO L272 TraceCheckUtils]: 7: Hoare triple {3908#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3908#true} is VALID [2022-04-08 15:13:19,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {3908#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:19,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {3913#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3914#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 15:13:19,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {3914#(= 8464 |ssl3_accept_#t~mem49|)} assume 8482 == #t~mem49;havoc #t~mem49; {3909#false} is VALID [2022-04-08 15:13:19,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {3909#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {3909#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {3909#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {3909#false} ~skip~0 := 0; {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {3909#false} assume !false; {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {3909#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {3909#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {3909#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {3909#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {3909#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {3909#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {3909#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {3909#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {3909#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {3909#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {3909#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {3909#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {3909#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {3909#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {3909#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {3909#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {3909#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {3909#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {3909#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {3909#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {3909#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {3909#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {3909#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {3909#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {3909#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {3909#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {3909#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {3909#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {3909#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {3909#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {3909#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {3909#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {3909#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3909#false} is VALID [2022-04-08 15:13:19,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {3909#false} assume 8672 == #t~mem74;havoc #t~mem74; {3909#false} is VALID [2022-04-08 15:13:19,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {3909#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {3909#false} is VALID [2022-04-08 15:13:19,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {3909#false} assume 4 == ~blastFlag~0; {3909#false} is VALID [2022-04-08 15:13:19,736 INFO L290 TraceCheckUtils]: 65: Hoare triple {3909#false} assume !false; {3909#false} is VALID [2022-04-08 15:13:19,737 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 15:13:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:19,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330865257] [2022-04-08 15:13:19,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330865257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:19,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:19,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:19,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:19,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91836394] [2022-04-08 15:13:19,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91836394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:19,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:19,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595684058] [2022-04-08 15:13:19,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:19,739 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 15:13:19,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:19,739 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 15:13:19,786 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 15:13:19,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:19,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:19,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:19,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:19,787 INFO L87 Difference]: Start difference. First operand 150 states and 225 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 15:13:21,818 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 15:13:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:22,755 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2022-04-08 15:13:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:22,755 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 15:13:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:22,755 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 15:13:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-08 15:13:22,760 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 15:13:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-08 15:13:22,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-08 15:13:23,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:23,064 INFO L225 Difference]: With dead ends: 288 [2022-04-08 15:13:23,064 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 15:13:23,065 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 15:13:23,066 INFO L913 BasicCegarLoop]: 183 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:23,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:13:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 15:13:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2022-04-08 15:13:23,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:23,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:23,076 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:23,077 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:23,081 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-08 15:13:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-08 15:13:23,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:23,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:23,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 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 164 states. [2022-04-08 15:13:23,083 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 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 164 states. [2022-04-08 15:13:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:23,088 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-08 15:13:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-08 15:13:23,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:23,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:23,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:23,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2022-04-08 15:13:23,107 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 66 [2022-04-08 15:13:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:23,107 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2022-04-08 15:13:23,107 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 15:13:23,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 224 transitions. [2022-04-08 15:13:23,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2022-04-08 15:13:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 15:13:23,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:23,262 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, 1, 1, 1] [2022-04-08 15:13:23,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:13:23,262 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 1 times [2022-04-08 15:13:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:23,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2051685624] [2022-04-08 15:13:23,303 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:23,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2086075870, now seen corresponding path program 2 times [2022-04-08 15:13:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861430990] [2022-04-08 15:13:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:23,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:23,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {5131#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {5124#true} is VALID [2022-04-08 15:13:23,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {5124#true} assume true; {5124#true} is VALID [2022-04-08 15:13:23,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5124#true} {5124#true} #664#return; {5124#true} is VALID [2022-04-08 15:13:23,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {5124#true} call ULTIMATE.init(); {5131#(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 15:13:23,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {5131#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {5124#true} is VALID [2022-04-08 15:13:23,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {5124#true} assume true; {5124#true} is VALID [2022-04-08 15:13:23,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5124#true} {5124#true} #664#return; {5124#true} is VALID [2022-04-08 15:13:23,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {5124#true} call #t~ret162 := main(); {5124#true} is VALID [2022-04-08 15:13:23,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {5124#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5124#true} is VALID [2022-04-08 15:13:23,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {5124#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5124#true} is VALID [2022-04-08 15:13:23,485 INFO L272 TraceCheckUtils]: 7: Hoare triple {5124#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5124#true} is VALID [2022-04-08 15:13:23,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {5124#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:23,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:23,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:23,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:23,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:23,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:23,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:23,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {5129#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {5130#(= 8464 |ssl3_accept_#t~mem42|)} is VALID [2022-04-08 15:13:23,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {5130#(= 8464 |ssl3_accept_#t~mem42|)} assume 12292 == #t~mem42;havoc #t~mem42; {5125#false} is VALID [2022-04-08 15:13:23,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {5125#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {5125#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {5125#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {5125#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {5125#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {5125#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {5125#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {5125#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {5125#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {5125#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {5125#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {5125#false} ~skip~0 := 0; {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {5125#false} assume !false; {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {5125#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {5125#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {5125#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {5125#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {5125#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {5125#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {5125#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {5125#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {5125#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {5125#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {5125#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {5125#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {5125#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {5125#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {5125#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {5125#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {5125#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {5125#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {5125#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {5125#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {5125#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {5125#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {5125#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {5125#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {5125#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {5125#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {5125#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {5125#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {5125#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {5125#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {5125#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {5125#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {5125#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {5125#false} assume 8672 == #t~mem74;havoc #t~mem74; {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {5125#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {5125#false} assume 4 == ~blastFlag~0; {5125#false} is VALID [2022-04-08 15:13:23,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {5125#false} assume !false; {5125#false} is VALID [2022-04-08 15:13:23,501 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 15:13:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:23,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861430990] [2022-04-08 15:13:23,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861430990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:23,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:23,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:23,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:23,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2051685624] [2022-04-08 15:13:23,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2051685624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:23,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:23,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803119055] [2022-04-08 15:13:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:23,504 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 15:13:23,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:23,505 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 15:13:23,562 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 15:13:23,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:23,564 INFO L87 Difference]: Start difference. First operand 150 states and 224 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 15:13:25,590 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 15:13:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:26,523 INFO L93 Difference]: Finished difference Result 287 states and 430 transitions. [2022-04-08 15:13:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:26,523 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 15:13:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:26,523 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 15:13:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-08 15:13:26,527 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 15:13:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2022-04-08 15:13:26,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 430 transitions. [2022-04-08 15:13:26,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:26,820 INFO L225 Difference]: With dead ends: 287 [2022-04-08 15:13:26,820 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 15:13:26,821 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 15:13:26,821 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 26 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:26,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:13:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 15:13:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-08 15:13:26,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:26,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:26,830 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:26,830 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:26,852 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2022-04-08 15:13:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2022-04-08 15:13:26,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:26,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:26,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 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 163 states. [2022-04-08 15:13:26,853 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 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 163 states. [2022-04-08 15:13:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:26,856 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2022-04-08 15:13:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2022-04-08 15:13:26,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:26,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:26,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:26,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5103448275862068) internal successors, (219), 145 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2022-04-08 15:13:26,863 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 67 [2022-04-08 15:13:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:26,863 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2022-04-08 15:13:26,863 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 15:13:26,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 223 transitions. [2022-04-08 15:13:27,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2022-04-08 15:13:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 15:13:27,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:27,029 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, 1, 1, 1] [2022-04-08 15:13:27,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:13:27,030 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 1 times [2022-04-08 15:13:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:27,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689653205] [2022-04-08 15:13:27,067 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:13:27,067 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1877545714, now seen corresponding path program 2 times [2022-04-08 15:13:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:27,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697653226] [2022-04-08 15:13:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:27,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:27,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {6343#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {6336#true} is VALID [2022-04-08 15:13:27,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {6336#true} assume true; {6336#true} is VALID [2022-04-08 15:13:27,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6336#true} {6336#true} #664#return; {6336#true} is VALID [2022-04-08 15:13:27,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {6336#true} call ULTIMATE.init(); {6343#(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 15:13:27,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {6336#true} is VALID [2022-04-08 15:13:27,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {6336#true} assume true; {6336#true} is VALID [2022-04-08 15:13:27,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6336#true} {6336#true} #664#return; {6336#true} is VALID [2022-04-08 15:13:27,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {6336#true} call #t~ret162 := main(); {6336#true} is VALID [2022-04-08 15:13:27,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {6336#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6336#true} is VALID [2022-04-08 15:13:27,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {6336#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {6336#true} is VALID [2022-04-08 15:13:27,234 INFO L272 TraceCheckUtils]: 7: Hoare triple {6336#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6336#true} is VALID [2022-04-08 15:13:27,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {6336#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:27,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {6341#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {6342#(= 8464 |ssl3_accept_#t~mem43|)} is VALID [2022-04-08 15:13:27,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {6342#(= 8464 |ssl3_accept_#t~mem43|)} assume 16384 == #t~mem43;havoc #t~mem43; {6337#false} is VALID [2022-04-08 15:13:27,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {6337#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {6337#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {6337#false} is VALID [2022-04-08 15:13:27,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {6337#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {6337#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {6337#false} is VALID [2022-04-08 15:13:27,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {6337#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {6337#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {6337#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {6337#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {6337#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {6337#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {6337#false} ~skip~0 := 0; {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {6337#false} assume !false; {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {6337#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {6337#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {6337#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {6337#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {6337#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {6337#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {6337#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {6337#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {6337#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,243 INFO L290 TraceCheckUtils]: 39: Hoare triple {6337#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {6337#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {6337#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {6337#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {6337#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {6337#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {6337#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {6337#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {6337#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {6337#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {6337#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {6337#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {6337#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {6337#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {6337#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 54: Hoare triple {6337#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 55: Hoare triple {6337#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {6337#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {6337#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {6337#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 59: Hoare triple {6337#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {6337#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {6337#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {6337#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {6337#false} assume 8672 == #t~mem74;havoc #t~mem74; {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {6337#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {6337#false} assume 4 == ~blastFlag~0; {6337#false} is VALID [2022-04-08 15:13:27,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {6337#false} assume !false; {6337#false} is VALID [2022-04-08 15:13:27,257 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 15:13:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:27,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697653226] [2022-04-08 15:13:27,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697653226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:27,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:27,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:27,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:27,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689653205] [2022-04-08 15:13:27,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689653205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:27,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:27,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893757783] [2022-04-08 15:13:27,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:27,258 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 15:13:27,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:27,259 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 15:13:27,315 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 15:13:27,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:27,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:27,317 INFO L87 Difference]: Start difference. First operand 150 states and 223 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 15:13:29,344 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 15:13:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:30,410 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2022-04-08 15:13:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:30,410 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 15:13:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:30,411 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 15:13:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-08 15:13:30,415 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 15:13:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-08 15:13:30,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-08 15:13:30,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:30,776 INFO L225 Difference]: With dead ends: 287 [2022-04-08 15:13:30,776 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 15:13:30,776 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 15:13:30,777 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:30,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 15:13:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-08 15:13:30,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:30,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,784 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,785 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:30,788 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2022-04-08 15:13:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2022-04-08 15:13:30,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:30,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:30,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 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 163 states. [2022-04-08 15:13:30,789 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 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 163 states. [2022-04-08 15:13:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:30,792 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2022-04-08 15:13:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2022-04-08 15:13:30,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:30,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:30,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:30,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.5034482758620689) internal successors, (218), 145 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2022-04-08 15:13:30,796 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 67 [2022-04-08 15:13:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:30,797 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2022-04-08 15:13:30,797 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 15:13:30,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 222 transitions. [2022-04-08 15:13:30,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2022-04-08 15:13:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 15:13:30,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:30,963 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, 1, 1, 1] [2022-04-08 15:13:30,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:13:30,963 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 1 times [2022-04-08 15:13:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:30,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460438802] [2022-04-08 15:13:30,990 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:13:30,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -175906935, now seen corresponding path program 2 times [2022-04-08 15:13:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731964481] [2022-04-08 15:13:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:31,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {7555#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {7548#true} is VALID [2022-04-08 15:13:31,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {7548#true} assume true; {7548#true} is VALID [2022-04-08 15:13:31,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7548#true} {7548#true} #664#return; {7548#true} is VALID [2022-04-08 15:13:31,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {7548#true} call ULTIMATE.init(); {7555#(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 15:13:31,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {7555#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {7548#true} is VALID [2022-04-08 15:13:31,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {7548#true} assume true; {7548#true} is VALID [2022-04-08 15:13:31,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7548#true} {7548#true} #664#return; {7548#true} is VALID [2022-04-08 15:13:31,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {7548#true} call #t~ret162 := main(); {7548#true} is VALID [2022-04-08 15:13:31,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {7548#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7548#true} is VALID [2022-04-08 15:13:31,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {7548#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7548#true} is VALID [2022-04-08 15:13:31,125 INFO L272 TraceCheckUtils]: 7: Hoare triple {7548#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7548#true} is VALID [2022-04-08 15:13:31,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {7548#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:31,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {7553#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7554#(= 8464 |ssl3_accept_#t~mem44|)} is VALID [2022-04-08 15:13:31,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {7554#(= 8464 |ssl3_accept_#t~mem44|)} assume 8192 == #t~mem44;havoc #t~mem44; {7549#false} is VALID [2022-04-08 15:13:31,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {7549#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {7549#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7549#false} is VALID [2022-04-08 15:13:31,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {7549#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {7549#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {7549#false} is VALID [2022-04-08 15:13:31,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {7549#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {7549#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {7549#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {7549#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {7549#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {7549#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {7549#false} ~skip~0 := 0; {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {7549#false} assume !false; {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {7549#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {7549#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {7549#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {7549#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {7549#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {7549#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {7549#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {7549#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {7549#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {7549#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {7549#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {7549#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {7549#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {7549#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {7549#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {7549#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {7549#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {7549#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {7549#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {7549#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {7549#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {7549#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {7549#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 54: Hoare triple {7549#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {7549#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {7549#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {7549#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {7549#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {7549#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {7549#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {7549#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,137 INFO L290 TraceCheckUtils]: 62: Hoare triple {7549#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {7549#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7549#false} is VALID [2022-04-08 15:13:31,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {7549#false} assume 8672 == #t~mem74;havoc #t~mem74; {7549#false} is VALID [2022-04-08 15:13:31,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {7549#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {7549#false} is VALID [2022-04-08 15:13:31,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {7549#false} assume 4 == ~blastFlag~0; {7549#false} is VALID [2022-04-08 15:13:31,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {7549#false} assume !false; {7549#false} is VALID [2022-04-08 15:13:31,137 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 15:13:31,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:31,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731964481] [2022-04-08 15:13:31,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731964481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:31,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:31,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:31,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:31,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460438802] [2022-04-08 15:13:31,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460438802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:31,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:31,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:31,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435813401] [2022-04-08 15:13:31,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:31,139 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 15:13:31,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:31,140 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 15:13:31,195 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 15:13:31,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:31,196 INFO L87 Difference]: Start difference. First operand 150 states and 222 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 15:13:33,223 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 15:13:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:34,280 INFO L93 Difference]: Finished difference Result 287 states and 428 transitions. [2022-04-08 15:13:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:34,280 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 15:13:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:34,281 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 15:13:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-08 15:13:34,285 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 15:13:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-08 15:13:34,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-08 15:13:34,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:34,606 INFO L225 Difference]: With dead ends: 287 [2022-04-08 15:13:34,606 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 15:13:34,606 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 15:13:34,607 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:34,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 15:13:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-08 15:13:34,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:34,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:34,614 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:34,614 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:34,617 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2022-04-08 15:13:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2022-04-08 15:13:34,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:34,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:34,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 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 163 states. [2022-04-08 15:13:34,618 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 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 163 states. [2022-04-08 15:13:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:34,621 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2022-04-08 15:13:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2022-04-08 15:13:34,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:34,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:34,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:34,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 145 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2022-04-08 15:13:34,626 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 68 [2022-04-08 15:13:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:34,626 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2022-04-08 15:13:34,626 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 15:13:34,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 221 transitions. [2022-04-08 15:13:34,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2022-04-08 15:13:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 15:13:34,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:34,801 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, 1, 1, 1] [2022-04-08 15:13:34,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:13:34,802 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 1 times [2022-04-08 15:13:34,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:34,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752904872] [2022-04-08 15:13:34,825 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:13:34,825 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash -167412983, now seen corresponding path program 2 times [2022-04-08 15:13:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:34,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702875195] [2022-04-08 15:13:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:34,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {8767#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {8760#true} is VALID [2022-04-08 15:13:34,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {8760#true} assume true; {8760#true} is VALID [2022-04-08 15:13:34,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8760#true} {8760#true} #664#return; {8760#true} is VALID [2022-04-08 15:13:34,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {8760#true} call ULTIMATE.init(); {8767#(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 15:13:34,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {8767#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {8760#true} is VALID [2022-04-08 15:13:34,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {8760#true} assume true; {8760#true} is VALID [2022-04-08 15:13:34,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8760#true} {8760#true} #664#return; {8760#true} is VALID [2022-04-08 15:13:34,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {8760#true} call #t~ret162 := main(); {8760#true} is VALID [2022-04-08 15:13:34,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {8760#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8760#true} is VALID [2022-04-08 15:13:34,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {8760#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {8760#true} is VALID [2022-04-08 15:13:34,981 INFO L272 TraceCheckUtils]: 7: Hoare triple {8760#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8760#true} is VALID [2022-04-08 15:13:34,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {8760#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:13:34,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {8765#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {8766#(not (= 24576 |ssl3_accept_#t~mem45|))} is VALID [2022-04-08 15:13:34,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {8766#(not (= 24576 |ssl3_accept_#t~mem45|))} assume 24576 == #t~mem45;havoc #t~mem45; {8761#false} is VALID [2022-04-08 15:13:34,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {8761#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {8761#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8761#false} is VALID [2022-04-08 15:13:34,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {8761#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {8761#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {8761#false} is VALID [2022-04-08 15:13:34,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {8761#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {8761#false} is VALID [2022-04-08 15:13:34,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {8761#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {8761#false} is VALID [2022-04-08 15:13:34,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {8761#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {8761#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {8761#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {8761#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {8761#false} is VALID [2022-04-08 15:13:34,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {8761#false} ~skip~0 := 0; {8761#false} is VALID [2022-04-08 15:13:34,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {8761#false} assume !false; {8761#false} is VALID [2022-04-08 15:13:34,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {8761#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {8761#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {8761#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {8761#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {8761#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {8761#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {8761#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {8761#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {8761#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {8761#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {8761#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {8761#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {8761#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {8761#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {8761#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {8761#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {8761#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {8761#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {8761#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {8761#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 52: Hoare triple {8761#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {8761#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {8761#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {8761#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {8761#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {8761#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {8761#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 59: Hoare triple {8761#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 60: Hoare triple {8761#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {8761#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {8761#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {8761#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 64: Hoare triple {8761#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 65: Hoare triple {8761#false} assume 8672 == #t~mem74;havoc #t~mem74; {8761#false} is VALID [2022-04-08 15:13:34,997 INFO L290 TraceCheckUtils]: 66: Hoare triple {8761#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {8761#false} is VALID [2022-04-08 15:13:34,998 INFO L290 TraceCheckUtils]: 67: Hoare triple {8761#false} assume 4 == ~blastFlag~0; {8761#false} is VALID [2022-04-08 15:13:34,998 INFO L290 TraceCheckUtils]: 68: Hoare triple {8761#false} assume !false; {8761#false} is VALID [2022-04-08 15:13:34,999 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 15:13:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:34,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702875195] [2022-04-08 15:13:34,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702875195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:34,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:34,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:34,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:35,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752904872] [2022-04-08 15:13:35,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752904872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:35,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:35,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773422851] [2022-04-08 15:13:35,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:35,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 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 69 [2022-04-08 15:13:35,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:35,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:35,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:35,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:35,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:35,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:35,064 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:37,089 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 15:13:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:38,387 INFO L93 Difference]: Finished difference Result 390 states and 589 transitions. [2022-04-08 15:13:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 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 69 [2022-04-08 15:13:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 15:13:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-08 15:13:38,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-08 15:13:38,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:38,904 INFO L225 Difference]: With dead ends: 390 [2022-04-08 15:13:38,904 INFO L226 Difference]: Without dead ends: 266 [2022-04-08 15:13:38,904 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 15:13:38,906 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:38,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:13:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-08 15:13:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 164. [2022-04-08 15:13:38,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:38,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,915 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,923 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:38,929 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-04-08 15:13:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2022-04-08 15:13:38,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:38,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:38,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 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 266 states. [2022-04-08 15:13:38,932 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 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 266 states. [2022-04-08 15:13:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:38,938 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-04-08 15:13:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 398 transitions. [2022-04-08 15:13:38,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:38,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:38,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:38,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2022-04-08 15:13:38,942 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 69 [2022-04-08 15:13:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:38,942 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2022-04-08 15:13:38,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:38,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 242 transitions. [2022-04-08 15:13:39,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-08 15:13:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 15:13:39,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:39,127 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, 1] [2022-04-08 15:13:39,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:13:39,128 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 1 times [2022-04-08 15:13:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:39,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027060167] [2022-04-08 15:13:39,157 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:39,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1642777843, now seen corresponding path program 2 times [2022-04-08 15:13:39,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:39,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647679213] [2022-04-08 15:13:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:39,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:39,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {10419#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {10412#true} is VALID [2022-04-08 15:13:39,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {10412#true} assume true; {10412#true} is VALID [2022-04-08 15:13:39,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10412#true} {10412#true} #664#return; {10412#true} is VALID [2022-04-08 15:13:39,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {10412#true} call ULTIMATE.init(); {10419#(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 15:13:39,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {10419#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {10412#true} is VALID [2022-04-08 15:13:39,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {10412#true} assume true; {10412#true} is VALID [2022-04-08 15:13:39,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10412#true} {10412#true} #664#return; {10412#true} is VALID [2022-04-08 15:13:39,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {10412#true} call #t~ret162 := main(); {10412#true} is VALID [2022-04-08 15:13:39,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {10412#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10412#true} is VALID [2022-04-08 15:13:39,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {10412#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L272 TraceCheckUtils]: 7: Hoare triple {10412#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {10412#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {10412#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {10412#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {10412#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {10412#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {10412#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {10412#true} assume !false; {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {10412#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {10412#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {10412#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {10412#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {10412#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {10412#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {10412#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {10412#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {10412#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {10412#true} assume 8464 == #t~mem50;havoc #t~mem50; {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {10412#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {10412#true} is VALID [2022-04-08 15:13:39,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {10412#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10412#true} is VALID [2022-04-08 15:13:39,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {10412#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:39,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {10417#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {10418#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {10418#(= |ssl3_accept_#t~mem53| 8496)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {10413#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {10413#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {10413#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {10413#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {10413#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {10413#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {10413#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {10413#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {10413#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {10413#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {10413#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {10413#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {10413#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {10413#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {10413#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {10413#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {10413#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {10413#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {10413#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {10413#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {10413#false} is VALID [2022-04-08 15:13:39,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {10413#false} assume 8672 == #t~mem74;havoc #t~mem74; {10413#false} is VALID [2022-04-08 15:13:39,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {10413#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {10413#false} is VALID [2022-04-08 15:13:39,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {10413#false} assume 4 == ~blastFlag~0; {10413#false} is VALID [2022-04-08 15:13:39,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {10413#false} assume !false; {10413#false} is VALID [2022-04-08 15:13:39,296 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 15:13:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647679213] [2022-04-08 15:13:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647679213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:39,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:39,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:39,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027060167] [2022-04-08 15:13:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027060167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:39,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:39,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505426361] [2022-04-08 15:13:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:39,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 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 69 [2022-04-08 15:13:39,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:39,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:39,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:39,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:39,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:39,359 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:41,389 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 15:13:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:42,494 INFO L93 Difference]: Finished difference Result 345 states and 518 transitions. [2022-04-08 15:13:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 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 69 [2022-04-08 15:13:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-08 15:13:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-08 15:13:42,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-08 15:13:42,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:42,913 INFO L225 Difference]: With dead ends: 345 [2022-04-08 15:13:42,913 INFO L226 Difference]: Without dead ends: 207 [2022-04-08 15:13:42,914 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 15:13:42,915 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 33 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:42,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 510 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-08 15:13:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2022-04-08 15:13:42,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:42,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 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 15:13:42,922 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 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 15:13:42,923 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 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 15:13:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:42,927 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2022-04-08 15:13:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 306 transitions. [2022-04-08 15:13:42,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:42,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:42,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 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 207 states. [2022-04-08 15:13:42,929 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 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 207 states. [2022-04-08 15:13:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:42,933 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2022-04-08 15:13:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 306 transitions. [2022-04-08 15:13:42,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:42,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:42,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:42,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 181 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 15:13:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 279 transitions. [2022-04-08 15:13:42,938 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 279 transitions. Word has length 69 [2022-04-08 15:13:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:42,938 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 279 transitions. [2022-04-08 15:13:42,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:42,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 279 transitions. [2022-04-08 15:13:43,142 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 15:13:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 279 transitions. [2022-04-08 15:13:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-08 15:13:43,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:43,143 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, 1, 1, 1] [2022-04-08 15:13:43,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:13:43,143 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1106801116, now seen corresponding path program 1 times [2022-04-08 15:13:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:43,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191137429] [2022-04-08 15:13:43,162 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:13:43,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1106801116, now seen corresponding path program 2 times [2022-04-08 15:13:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:43,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701698362] [2022-04-08 15:13:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:43,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:43,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:43,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {11907#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {11900#true} is VALID [2022-04-08 15:13:43,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {11900#true} assume true; {11900#true} is VALID [2022-04-08 15:13:43,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11900#true} {11900#true} #664#return; {11900#true} is VALID [2022-04-08 15:13:43,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {11900#true} call ULTIMATE.init(); {11907#(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 15:13:43,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {11907#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {11900#true} is VALID [2022-04-08 15:13:43,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {11900#true} assume true; {11900#true} is VALID [2022-04-08 15:13:43,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11900#true} {11900#true} #664#return; {11900#true} is VALID [2022-04-08 15:13:43,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {11900#true} call #t~ret162 := main(); {11900#true} is VALID [2022-04-08 15:13:43,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {11900#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11900#true} is VALID [2022-04-08 15:13:43,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {11900#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {11900#true} is VALID [2022-04-08 15:13:43,294 INFO L272 TraceCheckUtils]: 7: Hoare triple {11900#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11900#true} is VALID [2022-04-08 15:13:43,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {11900#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:43,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {11905#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11906#(= 8464 |ssl3_accept_#t~mem46|)} is VALID [2022-04-08 15:13:43,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {11906#(= 8464 |ssl3_accept_#t~mem46|)} assume 8195 == #t~mem46;havoc #t~mem46; {11901#false} is VALID [2022-04-08 15:13:43,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {11901#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {11901#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11901#false} is VALID [2022-04-08 15:13:43,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {11901#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {11901#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {11901#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {11901#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {11901#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {11901#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {11901#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {11901#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {11901#false} ~skip~0 := 0; {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {11901#false} assume !false; {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {11901#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {11901#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {11901#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {11901#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {11901#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {11901#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {11901#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {11901#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {11901#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {11901#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {11901#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {11901#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {11901#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {11901#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {11901#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {11901#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {11901#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {11901#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {11901#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {11901#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {11901#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {11901#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {11901#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {11901#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {11901#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {11901#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {11901#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {11901#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {11901#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {11901#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {11901#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {11901#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {11901#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {11901#false} is VALID [2022-04-08 15:13:43,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {11901#false} assume 8672 == #t~mem74;havoc #t~mem74; {11901#false} is VALID [2022-04-08 15:13:43,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {11901#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {11901#false} is VALID [2022-04-08 15:13:43,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {11901#false} assume 4 == ~blastFlag~0; {11901#false} is VALID [2022-04-08 15:13:43,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {11901#false} assume !false; {11901#false} is VALID [2022-04-08 15:13:43,307 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 15:13:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:43,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701698362] [2022-04-08 15:13:43,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701698362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:43,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:43,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:43,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:43,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191137429] [2022-04-08 15:13:43,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191137429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:43,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:43,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724923242] [2022-04-08 15:13:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:43,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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 70 [2022-04-08 15:13:43,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:43,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:43,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:43,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:43,375 INFO L87 Difference]: Start difference. First operand 186 states and 279 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:47,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:49,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:51,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:53,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:13:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:54,169 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2022-04-08 15:13:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:54,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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 70 [2022-04-08 15:13:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2022-04-08 15:13:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2022-04-08 15:13:54,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 413 transitions. [2022-04-08 15:13:54,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:54,520 INFO L225 Difference]: With dead ends: 349 [2022-04-08 15:13:54,521 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 15:13:54,521 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 15:13:54,522 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:54,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 484 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-04-08 15:13:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 15:13:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-04-08 15:13:54,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:54,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:54,529 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:54,529 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:54,533 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-04-08 15:13:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2022-04-08 15:13:54,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:54,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:54,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 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 189 states. [2022-04-08 15:13:54,534 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 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 189 states. [2022-04-08 15:13:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:54,538 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-04-08 15:13:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2022-04-08 15:13:54,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:54,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:54,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:54,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.5138121546961325) internal successors, (274), 181 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2022-04-08 15:13:54,542 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 70 [2022-04-08 15:13:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:54,542 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2022-04-08 15:13:54,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:54,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 278 transitions. [2022-04-08 15:13:54,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2022-04-08 15:13:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 15:13:54,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:54,781 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 15:13:54,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 15:13:54,781 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 1 times [2022-04-08 15:13:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:54,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1671272045] [2022-04-08 15:13:54,818 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:54,818 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -299545146, now seen corresponding path program 2 times [2022-04-08 15:13:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:54,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672520828] [2022-04-08 15:13:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:54,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {13367#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {13360#true} is VALID [2022-04-08 15:13:54,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {13360#true} assume true; {13360#true} is VALID [2022-04-08 15:13:54,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13360#true} {13360#true} #664#return; {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {13360#true} call ULTIMATE.init(); {13367#(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 15:13:54,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {13367#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {13360#true} assume true; {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13360#true} {13360#true} #664#return; {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {13360#true} call #t~ret162 := main(); {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {13360#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {13360#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L272 TraceCheckUtils]: 7: Hoare triple {13360#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13360#true} is VALID [2022-04-08 15:13:54,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {13360#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {13360#true} is VALID [2022-04-08 15:13:54,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {13360#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {13360#true} is VALID [2022-04-08 15:13:54,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {13360#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {13360#true} is VALID [2022-04-08 15:13:54,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {13360#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13360#true} is VALID [2022-04-08 15:13:54,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {13360#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {13360#true} is VALID [2022-04-08 15:13:54,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {13360#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {13360#true} is VALID [2022-04-08 15:13:54,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {13360#true} assume !false; {13360#true} is VALID [2022-04-08 15:13:54,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {13360#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {13360#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {13360#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {13360#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {13360#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {13360#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {13360#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {13360#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {13360#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {13360#true} is VALID [2022-04-08 15:13:54,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {13360#true} assume 8464 == #t~mem50;havoc #t~mem50; {13360#true} is VALID [2022-04-08 15:13:54,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {13360#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {13360#true} is VALID [2022-04-08 15:13:54,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {13360#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13360#true} is VALID [2022-04-08 15:13:54,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {13360#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:13:54,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {13365#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13366#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {13366#(= |ssl3_accept_#t~mem47| 8496)} assume 8480 == #t~mem47;havoc #t~mem47; {13361#false} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {13361#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {13361#false} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {13361#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {13361#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {13361#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {13361#false} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {13361#false} ~skip~0 := 0; {13361#false} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {13361#false} assume !false; {13361#false} is VALID [2022-04-08 15:13:54,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {13361#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {13361#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {13361#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {13361#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {13361#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {13361#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {13361#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {13361#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {13361#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {13361#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 55: Hoare triple {13361#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {13361#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {13361#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {13361#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {13361#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {13361#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {13361#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {13361#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {13361#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {13361#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {13361#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {13361#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 67: Hoare triple {13361#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {13361#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {13361#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {13361#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 71: Hoare triple {13361#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {13361#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {13361#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {13361#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,997 INFO L290 TraceCheckUtils]: 75: Hoare triple {13361#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,997 INFO L290 TraceCheckUtils]: 76: Hoare triple {13361#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,997 INFO L290 TraceCheckUtils]: 77: Hoare triple {13361#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {13361#false} is VALID [2022-04-08 15:13:54,997 INFO L290 TraceCheckUtils]: 78: Hoare triple {13361#false} assume 8672 == #t~mem74;havoc #t~mem74; {13361#false} is VALID [2022-04-08 15:13:54,997 INFO L290 TraceCheckUtils]: 79: Hoare triple {13361#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {13361#false} is VALID [2022-04-08 15:13:54,997 INFO L290 TraceCheckUtils]: 80: Hoare triple {13361#false} assume 4 == ~blastFlag~0; {13361#false} is VALID [2022-04-08 15:13:54,997 INFO L290 TraceCheckUtils]: 81: Hoare triple {13361#false} assume !false; {13361#false} is VALID [2022-04-08 15:13:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:13:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:54,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672520828] [2022-04-08 15:13:54,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672520828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:54,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:54,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:54,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:54,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1671272045] [2022-04-08 15:13:54,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1671272045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:54,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:54,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107074100] [2022-04-08 15:13:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:54,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 82 [2022-04-08 15:13:54,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:54,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:55,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:55,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:55,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:55,072 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:57,097 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 15:13:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:58,199 INFO L93 Difference]: Finished difference Result 367 states and 553 transitions. [2022-04-08 15:13:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:13:58,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 82 [2022-04-08 15:13:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:13:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 15:13:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 15:13:58,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 15:13:58,597 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 15:13:58,600 INFO L225 Difference]: With dead ends: 367 [2022-04-08 15:13:58,601 INFO L226 Difference]: Without dead ends: 207 [2022-04-08 15:13:58,601 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 15:13:58,602 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 38 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:13:58,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 482 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:13:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-08 15:13:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 186. [2022-04-08 15:13:58,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:13:58,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,611 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,611 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:58,617 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-08 15:13:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-08 15:13:58,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:58,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:58,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 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 207 states. [2022-04-08 15:13:58,618 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 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 207 states. [2022-04-08 15:13:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:58,623 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-08 15:13:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-08 15:13:58,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:58,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:58,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:58,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 277 transitions. [2022-04-08 15:13:58,629 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 277 transitions. Word has length 82 [2022-04-08 15:13:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:58,629 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 277 transitions. [2022-04-08 15:13:58,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:58,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 277 transitions. [2022-04-08 15:13:58,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 277 transitions. [2022-04-08 15:13:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 15:13:58,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:58,867 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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 15:13:58,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 15:13:58,867 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash 992393497, now seen corresponding path program 1 times [2022-04-08 15:13:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:58,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086608440] [2022-04-08 15:13:58,908 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:13:58,909 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:13:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 992393497, now seen corresponding path program 2 times [2022-04-08 15:13:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:58,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731462255] [2022-04-08 15:13:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:59,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {14899#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {14892#true} is VALID [2022-04-08 15:13:59,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {14892#true} assume true; {14892#true} is VALID [2022-04-08 15:13:59,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14892#true} {14892#true} #664#return; {14892#true} is VALID [2022-04-08 15:13:59,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {14892#true} call ULTIMATE.init(); {14899#(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 15:13:59,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {14899#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {14892#true} is VALID [2022-04-08 15:13:59,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {14892#true} assume true; {14892#true} is VALID [2022-04-08 15:13:59,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14892#true} {14892#true} #664#return; {14892#true} is VALID [2022-04-08 15:13:59,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {14892#true} call #t~ret162 := main(); {14892#true} is VALID [2022-04-08 15:13:59,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {14892#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {14892#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L272 TraceCheckUtils]: 7: Hoare triple {14892#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {14892#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {14892#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {14892#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {14892#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {14892#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {14892#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {14892#true} assume !false; {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {14892#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {14892#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {14892#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {14892#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {14892#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {14892#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {14892#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {14892#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {14892#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {14892#true} assume 8464 == #t~mem50;havoc #t~mem50; {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {14892#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {14892#true} is VALID [2022-04-08 15:13:59,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {14892#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14892#true} is VALID [2022-04-08 15:13:59,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {14892#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} ~skip~0 := 0; {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:13:59,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {14897#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14898#(not (= |ssl3_accept_#t~mem48| 8481))} is VALID [2022-04-08 15:13:59,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {14898#(not (= |ssl3_accept_#t~mem48| 8481))} assume 8481 == #t~mem48;havoc #t~mem48; {14893#false} is VALID [2022-04-08 15:13:59,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {14893#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {14893#false} is VALID [2022-04-08 15:13:59,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {14893#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {14893#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {14893#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {14893#false} is VALID [2022-04-08 15:13:59,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {14893#false} ~skip~0 := 0; {14893#false} is VALID [2022-04-08 15:13:59,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {14893#false} assume !false; {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {14893#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {14893#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {14893#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {14893#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {14893#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {14893#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {14893#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {14893#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {14893#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {14893#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {14893#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {14893#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {14893#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {14893#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {14893#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {14893#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {14893#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {14893#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {14893#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {14893#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {14893#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {14893#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {14893#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {14893#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {14893#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {14893#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {14893#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {14893#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 74: Hoare triple {14893#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 75: Hoare triple {14893#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {14893#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {14893#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {14893#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14893#false} is VALID [2022-04-08 15:13:59,095 INFO L290 TraceCheckUtils]: 79: Hoare triple {14893#false} assume 8672 == #t~mem74;havoc #t~mem74; {14893#false} is VALID [2022-04-08 15:13:59,095 INFO L290 TraceCheckUtils]: 80: Hoare triple {14893#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {14893#false} is VALID [2022-04-08 15:13:59,095 INFO L290 TraceCheckUtils]: 81: Hoare triple {14893#false} assume 4 == ~blastFlag~0; {14893#false} is VALID [2022-04-08 15:13:59,095 INFO L290 TraceCheckUtils]: 82: Hoare triple {14893#false} assume !false; {14893#false} is VALID [2022-04-08 15:13:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:13:59,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:59,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731462255] [2022-04-08 15:13:59,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731462255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:59,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:59,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:59,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:59,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086608440] [2022-04-08 15:13:59,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086608440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:59,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:59,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:13:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122030046] [2022-04-08 15:13:59,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:59,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 15:13:59,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:59,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:13:59,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:59,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:13:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:59,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:13:59,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:13:59,163 INFO L87 Difference]: Start difference. First operand 186 states and 277 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:01,189 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 15:14:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:02,406 INFO L93 Difference]: Finished difference Result 448 states and 680 transitions. [2022-04-08 15:14:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 15:14:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 15:14:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 15:14:02,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-08 15:14:02,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:02,921 INFO L225 Difference]: With dead ends: 448 [2022-04-08 15:14:02,921 INFO L226 Difference]: Without dead ends: 288 [2022-04-08 15:14:02,922 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 15:14:02,922 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:02,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-08 15:14:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 189. [2022-04-08 15:14:02,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:02,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:02,933 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:02,933 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:02,940 INFO L93 Difference]: Finished difference Result 288 states and 431 transitions. [2022-04-08 15:14:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2022-04-08 15:14:02,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:02,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:02,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-08 15:14:02,942 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 288 states. [2022-04-08 15:14:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:02,950 INFO L93 Difference]: Finished difference Result 288 states and 431 transitions. [2022-04-08 15:14:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2022-04-08 15:14:02,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:02,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:02,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:02,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 184 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 281 transitions. [2022-04-08 15:14:02,956 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 281 transitions. Word has length 83 [2022-04-08 15:14:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:02,956 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 281 transitions. [2022-04-08 15:14:02,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:02,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 281 transitions. [2022-04-08 15:14:03,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 281 transitions. [2022-04-08 15:14:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 15:14:03,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:03,205 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:14:03,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 15:14:03,205 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 1 times [2022-04-08 15:14:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:03,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1097406976] [2022-04-08 15:14:03,239 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:03,239 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash -301741538, now seen corresponding path program 2 times [2022-04-08 15:14:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:03,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847612748] [2022-04-08 15:14:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:03,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {16761#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {16754#true} is VALID [2022-04-08 15:14:03,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {16754#true} assume true; {16754#true} is VALID [2022-04-08 15:14:03,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16754#true} {16754#true} #664#return; {16754#true} is VALID [2022-04-08 15:14:03,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {16754#true} call ULTIMATE.init(); {16761#(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 15:14:03,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {16761#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {16754#true} is VALID [2022-04-08 15:14:03,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {16754#true} assume true; {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16754#true} {16754#true} #664#return; {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {16754#true} call #t~ret162 := main(); {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {16754#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {16754#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L272 TraceCheckUtils]: 7: Hoare triple {16754#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {16754#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {16754#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {16754#true} is VALID [2022-04-08 15:14:03,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {16754#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {16754#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {16754#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {16754#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {16754#true} assume !false; {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {16754#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {16754#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {16754#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {16754#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {16754#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {16754#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {16754#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {16754#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {16754#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16754#true} is VALID [2022-04-08 15:14:03,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {16754#true} assume 8464 == #t~mem50;havoc #t~mem50; {16754#true} is VALID [2022-04-08 15:14:03,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {16754#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {16754#true} is VALID [2022-04-08 15:14:03,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {16754#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16754#true} is VALID [2022-04-08 15:14:03,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {16754#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:03,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {16759#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16760#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-08 15:14:03,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {16760#(= |ssl3_accept_#t~mem49| 8496)} assume 8482 == #t~mem49;havoc #t~mem49; {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {16755#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {16755#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {16755#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {16755#false} ~skip~0 := 0; {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {16755#false} assume !false; {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {16755#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {16755#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {16755#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {16755#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {16755#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {16755#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {16755#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {16755#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {16755#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {16755#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {16755#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {16755#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {16755#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {16755#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {16755#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {16755#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {16755#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {16755#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 64: Hoare triple {16755#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 65: Hoare triple {16755#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {16755#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {16755#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {16755#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 69: Hoare triple {16755#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,376 INFO L290 TraceCheckUtils]: 70: Hoare triple {16755#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {16755#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {16755#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {16755#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {16755#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {16755#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {16755#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {16755#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {16755#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 79: Hoare triple {16755#false} assume 8672 == #t~mem74;havoc #t~mem74; {16755#false} is VALID [2022-04-08 15:14:03,377 INFO L290 TraceCheckUtils]: 80: Hoare triple {16755#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {16755#false} is VALID [2022-04-08 15:14:03,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {16755#false} assume 4 == ~blastFlag~0; {16755#false} is VALID [2022-04-08 15:14:03,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {16755#false} assume !false; {16755#false} is VALID [2022-04-08 15:14:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:03,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847612748] [2022-04-08 15:14:03,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847612748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:03,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:03,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:03,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:03,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1097406976] [2022-04-08 15:14:03,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1097406976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:03,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:03,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319041101] [2022-04-08 15:14:03,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 15:14:03,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:03,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:03,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:03,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:03,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:03,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:03,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:03,442 INFO L87 Difference]: Start difference. First operand 189 states and 281 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:05,470 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 15:14:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:06,493 INFO L93 Difference]: Finished difference Result 370 states and 556 transitions. [2022-04-08 15:14:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 15:14:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 15:14:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 15:14:06,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-08 15:14:06,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:06,820 INFO L225 Difference]: With dead ends: 370 [2022-04-08 15:14:06,821 INFO L226 Difference]: Without dead ends: 207 [2022-04-08 15:14:06,821 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 15:14:06,822 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 34 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:06,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 488 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-08 15:14:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2022-04-08 15:14:06,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:06,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:06,830 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:06,831 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:06,834 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-08 15:14:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-08 15:14:06,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:06,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:06,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 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 207 states. [2022-04-08 15:14:06,835 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 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 207 states. [2022-04-08 15:14:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:06,839 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2022-04-08 15:14:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2022-04-08 15:14:06,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:06,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:06,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:06,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.5) internal successors, (276), 184 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 280 transitions. [2022-04-08 15:14:06,843 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 280 transitions. Word has length 83 [2022-04-08 15:14:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:06,844 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 280 transitions. [2022-04-08 15:14:06,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:06,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 280 transitions. [2022-04-08 15:14:07,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 280 transitions. [2022-04-08 15:14:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 15:14:07,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:07,045 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:07,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 15:14:07,045 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 1 times [2022-04-08 15:14:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:07,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98354622] [2022-04-08 15:14:07,098 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:07,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash -276632906, now seen corresponding path program 2 times [2022-04-08 15:14:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:07,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973835189] [2022-04-08 15:14:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:07,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {18305#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {18298#true} is VALID [2022-04-08 15:14:07,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {18298#true} assume true; {18298#true} is VALID [2022-04-08 15:14:07,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18298#true} {18298#true} #664#return; {18298#true} is VALID [2022-04-08 15:14:07,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {18298#true} call ULTIMATE.init(); {18305#(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 15:14:07,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {18305#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {18298#true} assume true; {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18298#true} {18298#true} #664#return; {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {18298#true} call #t~ret162 := main(); {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {18298#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {18298#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L272 TraceCheckUtils]: 7: Hoare triple {18298#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {18298#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {18298#true} is VALID [2022-04-08 15:14:07,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {18298#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {18298#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {18298#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {18298#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {18298#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {18298#true} assume !false; {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {18298#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {18298#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {18298#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {18298#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {18298#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {18298#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {18298#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {18298#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {18298#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {18298#true} assume 8464 == #t~mem50;havoc #t~mem50; {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {18298#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {18298#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {18298#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {18298#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {18298#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {18298#true} ~skip~0 := 0; {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {18298#true} assume !false; {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {18298#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {18298#true} assume 12292 == #t~mem42;havoc #t~mem42; {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {18298#true} call write~int(1, ~s.base, 60 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {18298#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {18298#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {18298#true} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {18298#true} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {18298#true} is VALID [2022-04-08 15:14:07,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {18298#true} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {18298#true} is VALID [2022-04-08 15:14:07,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {18298#true} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {18298#true} is VALID [2022-04-08 15:14:07,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {18298#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {18298#true} is VALID [2022-04-08 15:14:07,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {18298#true} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:14:07,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {18303#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18304#(= |ssl3_accept_#t~mem47| 8480)} is VALID [2022-04-08 15:14:07,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {18304#(= |ssl3_accept_#t~mem47| 8480)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {18299#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {18299#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {18299#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {18299#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {18299#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {18299#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {18299#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {18299#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {18299#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 63: Hoare triple {18299#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {18299#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {18299#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {18299#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,264 INFO L290 TraceCheckUtils]: 67: Hoare triple {18299#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 68: Hoare triple {18299#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 69: Hoare triple {18299#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 70: Hoare triple {18299#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 71: Hoare triple {18299#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 72: Hoare triple {18299#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 73: Hoare triple {18299#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 74: Hoare triple {18299#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {18299#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {18299#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {18299#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {18299#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {18299#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {18299#false} is VALID [2022-04-08 15:14:07,266 INFO L290 TraceCheckUtils]: 80: Hoare triple {18299#false} assume 8672 == #t~mem74;havoc #t~mem74; {18299#false} is VALID [2022-04-08 15:14:07,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {18299#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {18299#false} is VALID [2022-04-08 15:14:07,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {18299#false} assume 4 == ~blastFlag~0; {18299#false} is VALID [2022-04-08 15:14:07,266 INFO L290 TraceCheckUtils]: 83: Hoare triple {18299#false} assume !false; {18299#false} is VALID [2022-04-08 15:14:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 15:14:07,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:07,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973835189] [2022-04-08 15:14:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973835189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:07,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:07,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:07,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:07,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98354622] [2022-04-08 15:14:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98354622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:07,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:07,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090788308] [2022-04-08 15:14:07,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 84 [2022-04-08 15:14:07,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:07,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:07,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:07,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:07,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:07,333 INFO L87 Difference]: Start difference. First operand 189 states and 280 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:09,357 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 15:14:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:10,467 INFO L93 Difference]: Finished difference Result 381 states and 572 transitions. [2022-04-08 15:14:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:10,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 84 [2022-04-08 15:14:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:14:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2022-04-08 15:14:10,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 439 transitions. [2022-04-08 15:14:10,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:10,829 INFO L225 Difference]: With dead ends: 381 [2022-04-08 15:14:10,829 INFO L226 Difference]: Without dead ends: 218 [2022-04-08 15:14:10,830 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 15:14:10,830 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 21 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:10,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 551 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-08 15:14:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2022-04-08 15:14:10,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:10,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:10,838 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:10,838 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:10,842 INFO L93 Difference]: Finished difference Result 218 states and 321 transitions. [2022-04-08 15:14:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2022-04-08 15:14:10,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:10,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:10,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 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 218 states. [2022-04-08 15:14:10,843 INFO L87 Difference]: Start difference. First operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 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 218 states. [2022-04-08 15:14:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:10,847 INFO L93 Difference]: Finished difference Result 218 states and 321 transitions. [2022-04-08 15:14:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2022-04-08 15:14:10,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:10,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:10,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:10,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.505) internal successors, (301), 200 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2022-04-08 15:14:10,851 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 84 [2022-04-08 15:14:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:10,852 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2022-04-08 15:14:10,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:10,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 305 transitions. [2022-04-08 15:14:11,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2022-04-08 15:14:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 15:14:11,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:11,092 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:11,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 15:14:11,092 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1096918579, now seen corresponding path program 1 times [2022-04-08 15:14:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:11,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690432778] [2022-04-08 15:14:11,137 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:11,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1096918579, now seen corresponding path program 2 times [2022-04-08 15:14:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:11,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521344057] [2022-04-08 15:14:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:11,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {19926#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {19918#true} is VALID [2022-04-08 15:14:11,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {19918#true} assume true; {19918#true} is VALID [2022-04-08 15:14:11,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19918#true} {19918#true} #664#return; {19918#true} is VALID [2022-04-08 15:14:11,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {19918#true} call ULTIMATE.init(); {19926#(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 15:14:11,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {19926#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {19918#true} is VALID [2022-04-08 15:14:11,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {19918#true} assume true; {19918#true} is VALID [2022-04-08 15:14:11,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19918#true} {19918#true} #664#return; {19918#true} is VALID [2022-04-08 15:14:11,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {19918#true} call #t~ret162 := main(); {19918#true} is VALID [2022-04-08 15:14:11,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {19918#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19918#true} is VALID [2022-04-08 15:14:11,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {19918#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L272 TraceCheckUtils]: 7: Hoare triple {19918#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {19918#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {19918#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {19918#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {19918#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {19918#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {19918#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {19918#true} assume !false; {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {19918#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {19918#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {19918#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {19918#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {19918#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {19918#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {19918#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {19918#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {19918#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {19918#true} assume 8464 == #t~mem50;havoc #t~mem50; {19918#true} is VALID [2022-04-08 15:14:11,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {19918#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {19918#true} is VALID [2022-04-08 15:14:11,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {19918#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19918#true} is VALID [2022-04-08 15:14:11,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {19918#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {19918#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {19918#true} is VALID [2022-04-08 15:14:11,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {19918#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19918#true} is VALID [2022-04-08 15:14:11,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {19918#true} ~skip~0 := 0; {19918#true} is VALID [2022-04-08 15:14:11,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {19918#true} assume !false; {19918#true} is VALID [2022-04-08 15:14:11,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {19918#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {19923#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {19923#(= |ssl3_accept_#t~mem42| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 12292 == #t~mem42;havoc #t~mem42; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 60 + ~s.offset, 4); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 56 + ~s.offset, 4); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:11,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {19924#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {19925#(= 12292 |ssl3_accept_#t~mem81|)} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {19925#(= 12292 |ssl3_accept_#t~mem81|)} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {19919#false} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {19919#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {19919#false} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {19919#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {19919#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {19919#false} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {19919#false} ~skip~0 := 0; {19919#false} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {19919#false} assume !false; {19919#false} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {19919#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {19919#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {19919#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {19919#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {19919#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {19919#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {19919#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {19919#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {19919#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {19919#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {19919#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {19919#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {19919#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {19919#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {19919#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {19919#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {19919#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {19919#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {19919#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {19919#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {19919#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {19919#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {19919#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {19919#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 72: Hoare triple {19919#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {19919#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {19919#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {19919#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 76: Hoare triple {19919#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,314 INFO L290 TraceCheckUtils]: 77: Hoare triple {19919#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L290 TraceCheckUtils]: 78: Hoare triple {19919#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L290 TraceCheckUtils]: 79: Hoare triple {19919#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L290 TraceCheckUtils]: 80: Hoare triple {19919#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L290 TraceCheckUtils]: 81: Hoare triple {19919#false} assume 8672 == #t~mem74;havoc #t~mem74; {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L290 TraceCheckUtils]: 82: Hoare triple {19919#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L290 TraceCheckUtils]: 83: Hoare triple {19919#false} assume 4 == ~blastFlag~0; {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L290 TraceCheckUtils]: 84: Hoare triple {19919#false} assume !false; {19919#false} is VALID [2022-04-08 15:14:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 15:14:11,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521344057] [2022-04-08 15:14:11,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521344057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:11,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:11,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:14:11,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690432778] [2022-04-08 15:14:11,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690432778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:11,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:11,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:14:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213020061] [2022-04-08 15:14:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:11,317 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 85 [2022-04-08 15:14:11,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:11,318 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 15:14:11,390 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 15:14:11,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 15:14:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 15:14:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:14:11,391 INFO L87 Difference]: Start difference. First operand 205 states and 305 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 15:14:13,421 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 15:14:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:14,476 INFO L93 Difference]: Finished difference Result 393 states and 592 transitions. [2022-04-08 15:14:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 15:14:14,476 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 85 [2022-04-08 15:14:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:14,477 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 15:14:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-08 15:14:14,479 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 15:14:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2022-04-08 15:14:14,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 409 transitions. [2022-04-08 15:14:14,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:14,742 INFO L225 Difference]: With dead ends: 393 [2022-04-08 15:14:14,742 INFO L226 Difference]: Without dead ends: 214 [2022-04-08 15:14:14,743 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 15:14:14,744 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:14,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 605 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 424 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:14:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-08 15:14:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-04-08 15:14:14,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:14,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:14,751 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:14,752 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:14,755 INFO L93 Difference]: Finished difference Result 214 states and 316 transitions. [2022-04-08 15:14:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2022-04-08 15:14:14,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:14,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:14,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 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 214 states. [2022-04-08 15:14:14,756 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 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 214 states. [2022-04-08 15:14:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:14,760 INFO L93 Difference]: Finished difference Result 214 states and 316 transitions. [2022-04-08 15:14:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2022-04-08 15:14:14,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:14,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:14,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:14,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 316 transitions. [2022-04-08 15:14:14,765 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 316 transitions. Word has length 85 [2022-04-08 15:14:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:14,765 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 316 transitions. [2022-04-08 15:14:14,765 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 15:14:14,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 316 transitions. [2022-04-08 15:14:14,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2022-04-08 15:14:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 15:14:14,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:14,994 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-04-08 15:14:14,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 15:14:14,995 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1028581177, now seen corresponding path program 1 times [2022-04-08 15:14:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:14,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537209232] [2022-04-08 15:14:15,042 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:15,043 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1028581177, now seen corresponding path program 2 times [2022-04-08 15:14:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:15,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224848036] [2022-04-08 15:14:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:15,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:15,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {21580#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {21573#true} is VALID [2022-04-08 15:14:15,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-08 15:14:15,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21573#true} {21573#true} #664#return; {21573#true} is VALID [2022-04-08 15:14:15,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {21573#true} call ULTIMATE.init(); {21580#(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 15:14:15,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {21580#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {21573#true} is VALID [2022-04-08 15:14:15,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {21573#true} assume true; {21573#true} is VALID [2022-04-08 15:14:15,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21573#true} {21573#true} #664#return; {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {21573#true} call #t~ret162 := main(); {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {21573#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {21573#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L272 TraceCheckUtils]: 7: Hoare triple {21573#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {21573#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {21573#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {21573#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {21573#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {21573#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {21573#true} is VALID [2022-04-08 15:14:15,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {21573#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#true} assume !false; {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {21573#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {21573#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {21573#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {21573#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {21573#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {21573#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {21573#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {21573#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21573#true} is VALID [2022-04-08 15:14:15,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {21573#true} assume 8464 == #t~mem50;havoc #t~mem50; {21573#true} is VALID [2022-04-08 15:14:15,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {21573#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21573#true} is VALID [2022-04-08 15:14:15,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {21573#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21573#true} is VALID [2022-04-08 15:14:15,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {21573#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:15,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:15,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:15,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} ~skip~0 := 0; {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:15,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:15,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:14:15,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {21578#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {21579#(not (= |ssl3_accept_#t~mem43| 16384))} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {21579#(not (= |ssl3_accept_#t~mem43| 16384))} assume 16384 == #t~mem43;havoc #t~mem43; {21574#false} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {21574#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {21574#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21574#false} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {21574#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {21574#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {21574#false} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {21574#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {21574#false} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {21574#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {21574#false} is VALID [2022-04-08 15:14:15,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {21574#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {21574#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {21574#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {21574#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {21574#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {21574#false} ~skip~0 := 0; {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {21574#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {21574#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {21574#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {21574#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {21574#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {21574#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {21574#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {21574#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {21574#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 57: Hoare triple {21574#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {21574#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {21574#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {21574#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {21574#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 62: Hoare triple {21574#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 63: Hoare triple {21574#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {21574#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {21574#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {21574#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {21574#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {21574#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {21574#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {21574#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,178 INFO L290 TraceCheckUtils]: 71: Hoare triple {21574#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 72: Hoare triple {21574#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {21574#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {21574#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {21574#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 76: Hoare triple {21574#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 77: Hoare triple {21574#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 78: Hoare triple {21574#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 79: Hoare triple {21574#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,179 INFO L290 TraceCheckUtils]: 80: Hoare triple {21574#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {21574#false} is VALID [2022-04-08 15:14:15,180 INFO L290 TraceCheckUtils]: 81: Hoare triple {21574#false} assume 8672 == #t~mem74;havoc #t~mem74; {21574#false} is VALID [2022-04-08 15:14:15,180 INFO L290 TraceCheckUtils]: 82: Hoare triple {21574#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {21574#false} is VALID [2022-04-08 15:14:15,180 INFO L290 TraceCheckUtils]: 83: Hoare triple {21574#false} assume 4 == ~blastFlag~0; {21574#false} is VALID [2022-04-08 15:14:15,180 INFO L290 TraceCheckUtils]: 84: Hoare triple {21574#false} assume !false; {21574#false} is VALID [2022-04-08 15:14:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224848036] [2022-04-08 15:14:15,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224848036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:15,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:15,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:15,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:15,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537209232] [2022-04-08 15:14:15,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537209232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:15,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824988823] [2022-04-08 15:14:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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 85 [2022-04-08 15:14:15,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:15,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:15,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:15,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:15,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:15,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:15,266 INFO L87 Difference]: Start difference. First operand 214 states and 316 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:17,292 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 15:14:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:18,405 INFO L93 Difference]: Finished difference Result 510 states and 763 transitions. [2022-04-08 15:14:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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 85 [2022-04-08 15:14:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 15:14:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 15:14:18,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-08 15:14:18,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:18,811 INFO L225 Difference]: With dead ends: 510 [2022-04-08 15:14:18,811 INFO L226 Difference]: Without dead ends: 322 [2022-04-08 15:14:18,811 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 15:14:18,812 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 143 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:18,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-08 15:14:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2022-04-08 15:14:18,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:18,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:18,821 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:18,822 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:18,828 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2022-04-08 15:14:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 474 transitions. [2022-04-08 15:14:18,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:18,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:18,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 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 322 states. [2022-04-08 15:14:18,829 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 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 322 states. [2022-04-08 15:14:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:18,835 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2022-04-08 15:14:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 474 transitions. [2022-04-08 15:14:18,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:18,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:18,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:18,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.4784688995215312) internal successors, (309), 209 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 313 transitions. [2022-04-08 15:14:18,841 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 313 transitions. Word has length 85 [2022-04-08 15:14:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:18,841 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 313 transitions. [2022-04-08 15:14:18,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:18,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 313 transitions. [2022-04-08 15:14:19,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2022-04-08 15:14:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 15:14:19,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:19,080 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:14:19,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 15:14:19,080 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -662610092, now seen corresponding path program 1 times [2022-04-08 15:14:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:19,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [614276624] [2022-04-08 15:14:19,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:19,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:19,132 INFO L85 PathProgramCache]: Analyzing trace with hash -662610092, now seen corresponding path program 2 times [2022-04-08 15:14:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:19,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015592415] [2022-04-08 15:14:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:19,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:19,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:19,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {23684#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {23677#true} is VALID [2022-04-08 15:14:19,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {23677#true} assume true; {23677#true} is VALID [2022-04-08 15:14:19,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23677#true} {23677#true} #664#return; {23677#true} is VALID [2022-04-08 15:14:19,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {23677#true} call ULTIMATE.init(); {23684#(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 15:14:19,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {23684#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {23677#true} is VALID [2022-04-08 15:14:19,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {23677#true} assume true; {23677#true} is VALID [2022-04-08 15:14:19,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23677#true} {23677#true} #664#return; {23677#true} is VALID [2022-04-08 15:14:19,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {23677#true} call #t~ret162 := main(); {23677#true} is VALID [2022-04-08 15:14:19,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {23677#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23677#true} is VALID [2022-04-08 15:14:19,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {23677#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23677#true} is VALID [2022-04-08 15:14:19,257 INFO L272 TraceCheckUtils]: 7: Hoare triple {23677#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23677#true} is VALID [2022-04-08 15:14:19,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {23677#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {23677#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {23677#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {23677#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {23677#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {23677#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {23677#true} assume !false; {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {23677#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {23677#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {23677#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {23677#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {23677#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {23677#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {23677#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {23677#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {23677#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23677#true} is VALID [2022-04-08 15:14:19,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {23677#true} assume 8464 == #t~mem50;havoc #t~mem50; {23677#true} is VALID [2022-04-08 15:14:19,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {23677#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {23677#true} is VALID [2022-04-08 15:14:19,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {23677#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23677#true} is VALID [2022-04-08 15:14:19,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {23677#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:19,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:19,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:19,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:19,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:19,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:19,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:19,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {23682#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23683#(not (= 8192 |ssl3_accept_#t~mem44|))} is VALID [2022-04-08 15:14:19,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {23683#(not (= 8192 |ssl3_accept_#t~mem44|))} assume 8192 == #t~mem44;havoc #t~mem44; {23678#false} is VALID [2022-04-08 15:14:19,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {23678#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {23678#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {23678#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {23678#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {23678#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {23678#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {23678#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {23678#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {23678#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {23678#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {23678#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {23678#false} is VALID [2022-04-08 15:14:19,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {23678#false} ~skip~0 := 0; {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {23678#false} assume !false; {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {23678#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {23678#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {23678#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {23678#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {23678#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {23678#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {23678#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {23678#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {23678#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {23678#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {23678#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {23678#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {23678#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {23678#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {23678#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {23678#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {23678#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {23678#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {23678#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {23678#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 69: Hoare triple {23678#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 70: Hoare triple {23678#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 71: Hoare triple {23678#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {23678#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {23678#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {23678#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,268 INFO L290 TraceCheckUtils]: 75: Hoare triple {23678#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 76: Hoare triple {23678#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 77: Hoare triple {23678#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 78: Hoare triple {23678#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 79: Hoare triple {23678#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 80: Hoare triple {23678#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 81: Hoare triple {23678#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 82: Hoare triple {23678#false} assume 8672 == #t~mem74;havoc #t~mem74; {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 83: Hoare triple {23678#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {23678#false} is VALID [2022-04-08 15:14:19,269 INFO L290 TraceCheckUtils]: 84: Hoare triple {23678#false} assume 4 == ~blastFlag~0; {23678#false} is VALID [2022-04-08 15:14:19,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {23678#false} assume !false; {23678#false} is VALID [2022-04-08 15:14:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:19,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:19,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015592415] [2022-04-08 15:14:19,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015592415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:19,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:19,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:19,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:19,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [614276624] [2022-04-08 15:14:19,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [614276624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:19,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:19,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169306230] [2022-04-08 15:14:19,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:19,272 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 86 [2022-04-08 15:14:19,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:19,272 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 15:14:19,340 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 15:14:19,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:19,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:19,341 INFO L87 Difference]: Start difference. First operand 214 states and 313 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 15:14:21,367 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 15:14:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:22,535 INFO L93 Difference]: Finished difference Result 510 states and 757 transitions. [2022-04-08 15:14:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:22,535 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 86 [2022-04-08 15:14:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:22,535 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 15:14:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 15:14:22,538 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 15:14:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 15:14:22,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-08 15:14:22,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:22,939 INFO L225 Difference]: With dead ends: 510 [2022-04-08 15:14:22,940 INFO L226 Difference]: Without dead ends: 322 [2022-04-08 15:14:22,940 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 15:14:22,941 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:22,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 321 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-08 15:14:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2022-04-08 15:14:22,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:22,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:22,951 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:22,951 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:22,961 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2022-04-08 15:14:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 471 transitions. [2022-04-08 15:14:22,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:22,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:22,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 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 322 states. [2022-04-08 15:14:22,962 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 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 322 states. [2022-04-08 15:14:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:22,969 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2022-04-08 15:14:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 471 transitions. [2022-04-08 15:14:22,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:22,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:22,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:22,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 209 states have internal predecessors, (306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 310 transitions. [2022-04-08 15:14:22,974 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 310 transitions. Word has length 86 [2022-04-08 15:14:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:22,974 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 310 transitions. [2022-04-08 15:14:22,974 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 15:14:22,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 310 transitions. [2022-04-08 15:14:23,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2022-04-08 15:14:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-08 15:14:23,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:23,261 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-08 15:14:23,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 15:14:23,261 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -398659815, now seen corresponding path program 1 times [2022-04-08 15:14:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:23,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [186438263] [2022-04-08 15:14:23,304 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:23,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -398659815, now seen corresponding path program 2 times [2022-04-08 15:14:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275701665] [2022-04-08 15:14:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:23,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:23,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {25788#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {25781#true} is VALID [2022-04-08 15:14:23,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {25781#true} assume true; {25781#true} is VALID [2022-04-08 15:14:23,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25781#true} {25781#true} #664#return; {25781#true} is VALID [2022-04-08 15:14:23,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {25781#true} call ULTIMATE.init(); {25788#(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 15:14:23,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {25788#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {25781#true} is VALID [2022-04-08 15:14:23,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {25781#true} assume true; {25781#true} is VALID [2022-04-08 15:14:23,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25781#true} {25781#true} #664#return; {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {25781#true} call #t~ret162 := main(); {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {25781#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {25781#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L272 TraceCheckUtils]: 7: Hoare triple {25781#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {25781#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {25781#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {25781#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {25781#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25781#true} is VALID [2022-04-08 15:14:23,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {25781#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {25781#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {25781#true} assume !false; {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {25781#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {25781#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {25781#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {25781#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {25781#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {25781#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {25781#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {25781#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {25781#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25781#true} is VALID [2022-04-08 15:14:23,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {25781#true} assume 8464 == #t~mem50;havoc #t~mem50; {25781#true} is VALID [2022-04-08 15:14:23,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {25781#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {25781#true} is VALID [2022-04-08 15:14:23,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {25781#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25781#true} is VALID [2022-04-08 15:14:23,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {25781#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:23,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {25786#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {25787#(not (= |ssl3_accept_#t~mem46| 8195))} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {25787#(not (= |ssl3_accept_#t~mem46| 8195))} assume 8195 == #t~mem46;havoc #t~mem46; {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {25782#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {25782#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {25782#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {25782#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {25782#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {25782#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {25782#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {25782#false} assume 12292 != #t~mem81;havoc #t~mem81;assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {25782#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem84 := read~int(#t~mem83.base, 128 + #t~mem83.offset, 4);call write~int(1 + #t~mem84, #t~mem83.base, 128 + #t~mem83.offset, 4);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {25782#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {25782#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {25782#false} ~skip~0 := 0; {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {25782#false} assume !false; {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {25782#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {25782#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {25782#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {25782#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {25782#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {25782#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {25782#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {25782#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {25782#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {25782#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {25782#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {25782#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {25782#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {25782#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 65: Hoare triple {25782#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 66: Hoare triple {25782#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 67: Hoare triple {25782#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 68: Hoare triple {25782#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {25782#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {25782#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {25782#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {25782#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 73: Hoare triple {25782#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,465 INFO L290 TraceCheckUtils]: 74: Hoare triple {25782#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {25782#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {25782#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {25782#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {25782#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {25782#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {25782#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 81: Hoare triple {25782#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 82: Hoare triple {25782#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 83: Hoare triple {25782#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25782#false} is VALID [2022-04-08 15:14:23,466 INFO L290 TraceCheckUtils]: 84: Hoare triple {25782#false} assume 8672 == #t~mem74;havoc #t~mem74; {25782#false} is VALID [2022-04-08 15:14:23,467 INFO L290 TraceCheckUtils]: 85: Hoare triple {25782#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {25782#false} is VALID [2022-04-08 15:14:23,467 INFO L290 TraceCheckUtils]: 86: Hoare triple {25782#false} assume 4 == ~blastFlag~0; {25782#false} is VALID [2022-04-08 15:14:23,467 INFO L290 TraceCheckUtils]: 87: Hoare triple {25782#false} assume !false; {25782#false} is VALID [2022-04-08 15:14:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:14:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:23,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275701665] [2022-04-08 15:14:23,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275701665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:23,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:23,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:23,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:23,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [186438263] [2022-04-08 15:14:23,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [186438263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:23,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:23,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420449467] [2022-04-08 15:14:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:23,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 88 [2022-04-08 15:14:23,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:23,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:23,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:23,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:23,548 INFO L87 Difference]: Start difference. First operand 214 states and 310 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:25,573 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 15:14:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:26,723 INFO L93 Difference]: Finished difference Result 500 states and 738 transitions. [2022-04-08 15:14:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:26,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 88 [2022-04-08 15:14:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-08 15:14:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-08 15:14:26,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-08 15:14:27,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:27,122 INFO L225 Difference]: With dead ends: 500 [2022-04-08 15:14:27,122 INFO L226 Difference]: Without dead ends: 312 [2022-04-08 15:14:27,123 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 15:14:27,123 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:27,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 323 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-08 15:14:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 214. [2022-04-08 15:14:27,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:27,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,133 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,133 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:27,139 INFO L93 Difference]: Finished difference Result 312 states and 455 transitions. [2022-04-08 15:14:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 455 transitions. [2022-04-08 15:14:27,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:27,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:27,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 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 312 states. [2022-04-08 15:14:27,140 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 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 312 states. [2022-04-08 15:14:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:27,146 INFO L93 Difference]: Finished difference Result 312 states and 455 transitions. [2022-04-08 15:14:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 455 transitions. [2022-04-08 15:14:27,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:27,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:27,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:27,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.4497607655502391) internal successors, (303), 209 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 307 transitions. [2022-04-08 15:14:27,151 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 307 transitions. Word has length 88 [2022-04-08 15:14:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:27,151 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 307 transitions. [2022-04-08 15:14:27,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 307 transitions. [2022-04-08 15:14:27,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 307 transitions. [2022-04-08 15:14:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 15:14:27,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:27,394 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:14:27,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 15:14:27,394 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1973605427, now seen corresponding path program 1 times [2022-04-08 15:14:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:27,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337606731] [2022-04-08 15:14:27,438 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:27,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:27,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1973605427, now seen corresponding path program 2 times [2022-04-08 15:14:27,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:27,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119054779] [2022-04-08 15:14:27,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:27,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:27,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {27852#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {27845#true} is VALID [2022-04-08 15:14:27,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {27845#true} assume true; {27845#true} is VALID [2022-04-08 15:14:27,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27845#true} {27845#true} #664#return; {27845#true} is VALID [2022-04-08 15:14:27,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {27845#true} call ULTIMATE.init(); {27852#(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 15:14:27,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {27852#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {27845#true} assume true; {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27845#true} {27845#true} #664#return; {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {27845#true} call #t~ret162 := main(); {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {27845#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {27845#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L272 TraceCheckUtils]: 7: Hoare triple {27845#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {27845#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {27845#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {27845#true} is VALID [2022-04-08 15:14:27,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {27845#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {27845#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {27845#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {27845#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {27845#true} assume !false; {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {27845#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {27845#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {27845#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {27845#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {27845#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {27845#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {27845#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {27845#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {27845#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {27845#true} assume 8464 == #t~mem50;havoc #t~mem50; {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {27845#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {27845#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {27845#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {27845#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {27845#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {27845#true} ~skip~0 := 0; {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {27845#true} assume !false; {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {27845#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {27845#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {27845#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {27845#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {27845#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {27845#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {27845#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {27845#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {27845#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {27845#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {27845#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {27845#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {27845#true} assume 8496 == #t~mem53;havoc #t~mem53; {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {27845#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {27845#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {27845#true} is VALID [2022-04-08 15:14:27,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {27845#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {27845#true} is VALID [2022-04-08 15:14:27,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {27845#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,608 INFO L290 TraceCheckUtils]: 62: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,610 INFO L290 TraceCheckUtils]: 67: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,610 INFO L290 TraceCheckUtils]: 68: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,610 INFO L290 TraceCheckUtils]: 69: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,611 INFO L290 TraceCheckUtils]: 70: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,611 INFO L290 TraceCheckUtils]: 71: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,612 INFO L290 TraceCheckUtils]: 72: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,612 INFO L290 TraceCheckUtils]: 73: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,613 INFO L290 TraceCheckUtils]: 74: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,613 INFO L290 TraceCheckUtils]: 75: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,614 INFO L290 TraceCheckUtils]: 76: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,614 INFO L290 TraceCheckUtils]: 77: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,614 INFO L290 TraceCheckUtils]: 78: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,615 INFO L290 TraceCheckUtils]: 79: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,615 INFO L290 TraceCheckUtils]: 80: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,616 INFO L290 TraceCheckUtils]: 81: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,616 INFO L290 TraceCheckUtils]: 82: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,617 INFO L290 TraceCheckUtils]: 83: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,617 INFO L290 TraceCheckUtils]: 84: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,617 INFO L290 TraceCheckUtils]: 85: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-08 15:14:27,618 INFO L290 TraceCheckUtils]: 86: Hoare triple {27850#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {27851#(not (= |ssl3_accept_#t~mem74| 8672))} is VALID [2022-04-08 15:14:27,618 INFO L290 TraceCheckUtils]: 87: Hoare triple {27851#(not (= |ssl3_accept_#t~mem74| 8672))} assume 8672 == #t~mem74;havoc #t~mem74; {27846#false} is VALID [2022-04-08 15:14:27,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {27846#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {27846#false} is VALID [2022-04-08 15:14:27,618 INFO L290 TraceCheckUtils]: 89: Hoare triple {27846#false} assume 4 == ~blastFlag~0; {27846#false} is VALID [2022-04-08 15:14:27,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {27846#false} assume !false; {27846#false} is VALID [2022-04-08 15:14:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:14:27,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:27,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119054779] [2022-04-08 15:14:27,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119054779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:27,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:27,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:27,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:27,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [337606731] [2022-04-08 15:14:27,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [337606731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:27,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:27,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:27,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295065165] [2022-04-08 15:14:27,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:27,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 15:14:27,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:27,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:27,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:27,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:27,682 INFO L87 Difference]: Start difference. First operand 214 states and 307 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:29,708 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 15:14:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:30,814 INFO L93 Difference]: Finished difference Result 517 states and 756 transitions. [2022-04-08 15:14:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:30,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-08 15:14:30,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-08 15:14:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-08 15:14:30,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-08 15:14:31,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:31,231 INFO L225 Difference]: With dead ends: 517 [2022-04-08 15:14:31,232 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 15:14:31,232 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 15:14:31,233 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 107 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:31,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 324 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 15:14:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 257. [2022-04-08 15:14:31,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:31,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:31,244 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:31,245 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:31,250 INFO L93 Difference]: Finished difference Result 329 states and 478 transitions. [2022-04-08 15:14:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 478 transitions. [2022-04-08 15:14:31,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:31,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:31,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 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 329 states. [2022-04-08 15:14:31,252 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 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 329 states. [2022-04-08 15:14:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:31,258 INFO L93 Difference]: Finished difference Result 329 states and 478 transitions. [2022-04-08 15:14:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 478 transitions. [2022-04-08 15:14:31,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:31,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:31,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:31,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.5) internal successors, (378), 252 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2022-04-08 15:14:31,264 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 91 [2022-04-08 15:14:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:31,265 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2022-04-08 15:14:31,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:31,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 382 transitions. [2022-04-08 15:14:31,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2022-04-08 15:14:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 15:14:31,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:31,560 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 15:14:31,560 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 15:14:31,560 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1059321323, now seen corresponding path program 1 times [2022-04-08 15:14:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:31,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620806024] [2022-04-08 15:14:31,598 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:31,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:31,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1059321323, now seen corresponding path program 2 times [2022-04-08 15:14:31,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:31,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641989216] [2022-04-08 15:14:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:31,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:31,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {30070#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {30063#true} is VALID [2022-04-08 15:14:31,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-08 15:14:31,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30063#true} {30063#true} #664#return; {30063#true} is VALID [2022-04-08 15:14:31,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {30063#true} call ULTIMATE.init(); {30070#(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 15:14:31,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {30070#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {30063#true} is VALID [2022-04-08 15:14:31,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-08 15:14:31,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30063#true} {30063#true} #664#return; {30063#true} is VALID [2022-04-08 15:14:31,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {30063#true} call #t~ret162 := main(); {30063#true} is VALID [2022-04-08 15:14:31,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {30063#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30063#true} is VALID [2022-04-08 15:14:31,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {30063#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L272 TraceCheckUtils]: 7: Hoare triple {30063#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {30063#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {30063#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {30063#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {30063#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {30063#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {30063#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {30063#true} assume !false; {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {30063#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {30063#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {30063#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {30063#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {30063#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {30063#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {30063#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {30063#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {30063#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {30063#true} assume 8464 == #t~mem50;havoc #t~mem50; {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {30063#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {30063#true} is VALID [2022-04-08 15:14:31,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {30063#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {30063#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {30063#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {30063#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {30063#true} ~skip~0 := 0; {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {30063#true} assume !false; {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {30063#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {30063#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {30063#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {30063#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {30063#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {30063#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {30063#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {30063#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {30063#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {30063#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {30063#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {30063#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {30063#true} assume 8496 == #t~mem53;havoc #t~mem53; {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {30063#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {30063#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30063#true} is VALID [2022-04-08 15:14:31,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {30063#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {30063#true} is VALID [2022-04-08 15:14:31,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {30063#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,735 INFO L290 TraceCheckUtils]: 65: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,735 INFO L290 TraceCheckUtils]: 66: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,736 INFO L290 TraceCheckUtils]: 68: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,737 INFO L290 TraceCheckUtils]: 71: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,737 INFO L290 TraceCheckUtils]: 72: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,738 INFO L290 TraceCheckUtils]: 73: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,738 INFO L290 TraceCheckUtils]: 74: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,739 INFO L290 TraceCheckUtils]: 75: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,739 INFO L290 TraceCheckUtils]: 76: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,740 INFO L290 TraceCheckUtils]: 79: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:31,744 INFO L290 TraceCheckUtils]: 87: Hoare triple {30068#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8672 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {30069#(not (= |ssl3_accept_#t~mem75| 8673))} is VALID [2022-04-08 15:14:31,744 INFO L290 TraceCheckUtils]: 88: Hoare triple {30069#(not (= |ssl3_accept_#t~mem75| 8673))} assume 8673 == #t~mem75;havoc #t~mem75; {30064#false} is VALID [2022-04-08 15:14:31,744 INFO L290 TraceCheckUtils]: 89: Hoare triple {30064#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {30064#false} is VALID [2022-04-08 15:14:31,744 INFO L290 TraceCheckUtils]: 90: Hoare triple {30064#false} assume 4 == ~blastFlag~0; {30064#false} is VALID [2022-04-08 15:14:31,744 INFO L290 TraceCheckUtils]: 91: Hoare triple {30064#false} assume !false; {30064#false} is VALID [2022-04-08 15:14:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:14:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:31,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641989216] [2022-04-08 15:14:31,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641989216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:31,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:31,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:31,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:31,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620806024] [2022-04-08 15:14:31,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620806024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:31,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:31,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853503906] [2022-04-08 15:14:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:31,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 92 [2022-04-08 15:14:31,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:31,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:31,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:31,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:31,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:31,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:31,818 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:33,842 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 15:14:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:34,979 INFO L93 Difference]: Finished difference Result 586 states and 882 transitions. [2022-04-08 15:14:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:34,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 92 [2022-04-08 15:14:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-08 15:14:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-08 15:14:34,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-08 15:14:35,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:35,386 INFO L225 Difference]: With dead ends: 586 [2022-04-08 15:14:35,386 INFO L226 Difference]: Without dead ends: 353 [2022-04-08 15:14:35,387 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 15:14:35,387 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 108 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:35,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 339 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-08 15:14:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 282. [2022-04-08 15:14:35,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:35,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 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 15:14:35,402 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 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 15:14:35,402 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 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 15:14:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:35,409 INFO L93 Difference]: Finished difference Result 353 states and 526 transitions. [2022-04-08 15:14:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 526 transitions. [2022-04-08 15:14:35,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:35,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:35,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 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 353 states. [2022-04-08 15:14:35,410 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 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 353 states. [2022-04-08 15:14:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:35,417 INFO L93 Difference]: Finished difference Result 353 states and 526 transitions. [2022-04-08 15:14:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 526 transitions. [2022-04-08 15:14:35,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:35,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:35,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:35,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.5415162454873645) internal successors, (427), 277 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 15:14:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 431 transitions. [2022-04-08 15:14:35,424 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 431 transitions. Word has length 92 [2022-04-08 15:14:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:35,425 INFO L478 AbstractCegarLoop]: Abstraction has 282 states and 431 transitions. [2022-04-08 15:14:35,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:35,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 282 states and 431 transitions. [2022-04-08 15:14:35,825 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 15:14:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 431 transitions. [2022-04-08 15:14:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 15:14:35,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:35,827 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, 1, 1, 1] [2022-04-08 15:14:35,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 15:14:35,827 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash 502133768, now seen corresponding path program 1 times [2022-04-08 15:14:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:35,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98608349] [2022-04-08 15:14:35,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:35,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash 502133768, now seen corresponding path program 2 times [2022-04-08 15:14:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:35,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254010967] [2022-04-08 15:14:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:36,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {32524#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {32517#true} is VALID [2022-04-08 15:14:36,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {32517#true} assume true; {32517#true} is VALID [2022-04-08 15:14:36,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32517#true} {32517#true} #664#return; {32517#true} is VALID [2022-04-08 15:14:36,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {32517#true} call ULTIMATE.init(); {32524#(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 15:14:36,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {32524#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {32517#true} is VALID [2022-04-08 15:14:36,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {32517#true} assume true; {32517#true} is VALID [2022-04-08 15:14:36,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32517#true} {32517#true} #664#return; {32517#true} is VALID [2022-04-08 15:14:36,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {32517#true} call #t~ret162 := main(); {32517#true} is VALID [2022-04-08 15:14:36,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {32517#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32517#true} is VALID [2022-04-08 15:14:36,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {32517#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32517#true} is VALID [2022-04-08 15:14:36,033 INFO L272 TraceCheckUtils]: 7: Hoare triple {32517#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32517#true} is VALID [2022-04-08 15:14:36,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {32517#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {32517#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {32517#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {32517#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {32517#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {32517#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {32517#true} assume !false; {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {32517#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {32517#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {32517#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {32517#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {32517#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {32517#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {32517#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {32517#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {32517#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {32517#true} assume 8464 == #t~mem50;havoc #t~mem50; {32517#true} is VALID [2022-04-08 15:14:36,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {32517#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {32517#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {32517#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {32517#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {32517#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {32517#true} ~skip~0 := 0; {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {32517#true} assume !false; {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {32517#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {32517#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {32517#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {32517#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {32517#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {32517#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {32517#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {32517#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {32517#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {32517#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {32517#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {32517#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {32517#true} assume 8496 == #t~mem53;havoc #t~mem53; {32517#true} is VALID [2022-04-08 15:14:36,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {32517#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {32517#true} is VALID [2022-04-08 15:14:36,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {32517#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32517#true} is VALID [2022-04-08 15:14:36,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {32517#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {32517#true} is VALID [2022-04-08 15:14:36,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {32517#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,042 INFO L290 TraceCheckUtils]: 55: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,044 INFO L290 TraceCheckUtils]: 61: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,045 INFO L290 TraceCheckUtils]: 63: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,045 INFO L290 TraceCheckUtils]: 64: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,047 INFO L290 TraceCheckUtils]: 69: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,049 INFO L290 TraceCheckUtils]: 72: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,049 INFO L290 TraceCheckUtils]: 73: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,050 INFO L290 TraceCheckUtils]: 74: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:14:36,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {32522#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32523#(not (= 8448 |ssl3_accept_#t~mem63|))} is VALID [2022-04-08 15:14:36,050 INFO L290 TraceCheckUtils]: 76: Hoare triple {32523#(not (= 8448 |ssl3_accept_#t~mem63|))} assume 8448 == #t~mem63;havoc #t~mem63; {32518#false} is VALID [2022-04-08 15:14:36,050 INFO L290 TraceCheckUtils]: 77: Hoare triple {32518#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 78: Hoare triple {32518#false} assume !(~num1~0 > 0); {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {32518#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem132 := read~int(#t~mem131.base, 904 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 72 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 80: Hoare triple {32518#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 81: Hoare triple {32518#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {32518#false} ~skip~0 := 0; {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {32518#false} assume !false; {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {32518#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 85: Hoare triple {32518#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {32518#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,051 INFO L290 TraceCheckUtils]: 87: Hoare triple {32518#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {32518#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {32518#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {32518#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 91: Hoare triple {32518#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 92: Hoare triple {32518#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 93: Hoare triple {32518#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 94: Hoare triple {32518#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 95: Hoare triple {32518#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 96: Hoare triple {32518#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,052 INFO L290 TraceCheckUtils]: 97: Hoare triple {32518#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {32518#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 99: Hoare triple {32518#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 100: Hoare triple {32518#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 101: Hoare triple {32518#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 102: Hoare triple {32518#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 103: Hoare triple {32518#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 104: Hoare triple {32518#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {32518#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 106: Hoare triple {32518#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,053 INFO L290 TraceCheckUtils]: 107: Hoare triple {32518#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 108: Hoare triple {32518#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 109: Hoare triple {32518#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 110: Hoare triple {32518#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 111: Hoare triple {32518#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 112: Hoare triple {32518#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 113: Hoare triple {32518#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 114: Hoare triple {32518#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 115: Hoare triple {32518#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,054 INFO L290 TraceCheckUtils]: 116: Hoare triple {32518#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {32518#false} is VALID [2022-04-08 15:14:36,055 INFO L290 TraceCheckUtils]: 117: Hoare triple {32518#false} assume 8672 == #t~mem74;havoc #t~mem74; {32518#false} is VALID [2022-04-08 15:14:36,055 INFO L290 TraceCheckUtils]: 118: Hoare triple {32518#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {32518#false} is VALID [2022-04-08 15:14:36,055 INFO L290 TraceCheckUtils]: 119: Hoare triple {32518#false} assume 4 == ~blastFlag~0; {32518#false} is VALID [2022-04-08 15:14:36,055 INFO L290 TraceCheckUtils]: 120: Hoare triple {32518#false} assume !false; {32518#false} is VALID [2022-04-08 15:14:36,055 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 15:14:36,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:36,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254010967] [2022-04-08 15:14:36,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254010967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:36,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:36,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:36,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:36,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98608349] [2022-04-08 15:14:36,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98608349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:36,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:36,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:36,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501908433] [2022-04-08 15:14:36,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:36,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-08 15:14:36,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:36,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:36,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:36,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:36,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:36,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:36,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:36,144 INFO L87 Difference]: Start difference. First operand 282 states and 431 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:38,169 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 15:14:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:39,303 INFO L93 Difference]: Finished difference Result 647 states and 995 transitions. [2022-04-08 15:14:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-08 15:14:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-08 15:14:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-08 15:14:39,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-08 15:14:39,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:39,709 INFO L225 Difference]: With dead ends: 647 [2022-04-08 15:14:39,709 INFO L226 Difference]: Without dead ends: 391 [2022-04-08 15:14:39,709 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 15:14:39,710 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 115 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:39,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 355 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:14:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-08 15:14:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 314. [2022-04-08 15:14:39,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:39,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:39,725 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:39,726 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:39,734 INFO L93 Difference]: Finished difference Result 391 states and 592 transitions. [2022-04-08 15:14:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2022-04-08 15:14:39,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:39,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:39,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 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 391 states. [2022-04-08 15:14:39,736 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 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 391 states. [2022-04-08 15:14:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:39,745 INFO L93 Difference]: Finished difference Result 391 states and 592 transitions. [2022-04-08 15:14:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2022-04-08 15:14:39,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:39,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:39,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:39,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 309 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 483 transitions. [2022-04-08 15:14:39,753 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 483 transitions. Word has length 121 [2022-04-08 15:14:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:39,754 INFO L478 AbstractCegarLoop]: Abstraction has 314 states and 483 transitions. [2022-04-08 15:14:39,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:39,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 314 states and 483 transitions. [2022-04-08 15:14:40,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 483 edges. 483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 483 transitions. [2022-04-08 15:14:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 15:14:40,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:40,155 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, 1, 1, 1, 1] [2022-04-08 15:14:40,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 15:14:40,155 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1513581320, now seen corresponding path program 1 times [2022-04-08 15:14:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:40,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [236360752] [2022-04-08 15:14:40,240 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:40,240 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1513581320, now seen corresponding path program 2 times [2022-04-08 15:14:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262670830] [2022-04-08 15:14:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:40,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {35240#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {35233#true} is VALID [2022-04-08 15:14:40,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {35233#true} assume true; {35233#true} is VALID [2022-04-08 15:14:40,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35233#true} {35233#true} #664#return; {35233#true} is VALID [2022-04-08 15:14:40,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {35233#true} call ULTIMATE.init(); {35240#(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 15:14:40,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {35240#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {35233#true} is VALID [2022-04-08 15:14:40,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {35233#true} assume true; {35233#true} is VALID [2022-04-08 15:14:40,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35233#true} {35233#true} #664#return; {35233#true} is VALID [2022-04-08 15:14:40,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {35233#true} call #t~ret162 := main(); {35233#true} is VALID [2022-04-08 15:14:40,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {35233#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35233#true} is VALID [2022-04-08 15:14:40,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {35233#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35233#true} is VALID [2022-04-08 15:14:40,375 INFO L272 TraceCheckUtils]: 7: Hoare triple {35233#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {35233#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {35233#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {35233#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {35233#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {35233#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {35233#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {35233#true} assume !false; {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {35233#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {35233#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {35233#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {35233#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {35233#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {35233#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {35233#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {35233#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {35233#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {35233#true} assume 8464 == #t~mem50;havoc #t~mem50; {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {35233#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {35233#true} is VALID [2022-04-08 15:14:40,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {35233#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35233#true} is VALID [2022-04-08 15:14:40,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {35233#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:40,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:40,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:40,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:40,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:14:40,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {35238#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35239#(= |ssl3_accept_#t~mem42| 8496)} is VALID [2022-04-08 15:14:40,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {35239#(= |ssl3_accept_#t~mem42| 8496)} assume 12292 == #t~mem42;havoc #t~mem42; {35234#false} is VALID [2022-04-08 15:14:40,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {35234#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {35234#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {35234#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {35234#false} is VALID [2022-04-08 15:14:40,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {35234#false} call #t~mem77 := read~int(~s.base, ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {35234#false} assume !(3 != #t~mem77 / 256);havoc #t~mem77;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem78.base, #t~mem78.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {35234#false} assume !(0 == (#t~mem78.base + #t~mem78.offset) % 18446744073709551616);havoc #t~mem78.base, #t~mem78.offset; {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {35234#false} assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~tmp___4~0 := #t~nondet80;havoc #t~nondet80; {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {35234#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem81 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {35234#false} assume !(12292 != #t~mem81);havoc #t~mem81;call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem86 := read~int(#t~mem85.base, 132 + #t~mem85.offset, 4);call write~int(1 + #t~mem86, #t~mem85.base, 132 + #t~mem85.offset, 4);havoc #t~mem85.base, #t~mem85.offset;havoc #t~mem86;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {35234#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {35234#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {35234#false} ~skip~0 := 0; {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {35234#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {35234#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {35234#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {35234#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {35234#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {35234#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {35234#false} assume 8480 == #t~mem47;havoc #t~mem47; {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {35234#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet87 && #t~nondet87 <= 2147483647;~ret~0 := #t~nondet87;havoc #t~nondet87; {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {35234#false} assume !(~ret~0 <= 0);call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem88.base, 904 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {35234#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {35234#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35234#false} is VALID [2022-04-08 15:14:40,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {35234#false} ~skip~0 := 0; {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 59: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {35234#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {35234#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {35234#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {35234#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {35234#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {35234#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {35234#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {35234#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {35234#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {35234#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {35234#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {35234#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {35234#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 73: Hoare triple {35234#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 74: Hoare triple {35234#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 75: Hoare triple {35234#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 76: Hoare triple {35234#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {35234#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {35234#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 79: Hoare triple {35234#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 80: Hoare triple {35234#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 81: Hoare triple {35234#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 82: Hoare triple {35234#false} assume 8448 == #t~mem63;havoc #t~mem63; {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 83: Hoare triple {35234#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~num1~0 := #t~nondet130;havoc #t~nondet130; {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 84: Hoare triple {35234#false} assume !(~num1~0 > 0); {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 85: Hoare triple {35234#false} call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem132 := read~int(#t~mem131.base, 904 + #t~mem131.offset, 4);call write~int(#t~mem132, ~s.base, 72 + ~s.offset, 4);havoc #t~mem131.base, #t~mem131.offset;havoc #t~mem132; {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 86: Hoare triple {35234#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 87: Hoare triple {35234#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {35234#false} is VALID [2022-04-08 15:14:40,386 INFO L290 TraceCheckUtils]: 88: Hoare triple {35234#false} ~skip~0 := 0; {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {35234#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 91: Hoare triple {35234#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {35234#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {35234#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {35234#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {35234#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {35234#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {35234#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {35234#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {35234#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {35234#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {35234#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {35234#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 103: Hoare triple {35234#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 104: Hoare triple {35234#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {35234#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 106: Hoare triple {35234#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {35234#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 108: Hoare triple {35234#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 109: Hoare triple {35234#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 110: Hoare triple {35234#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 111: Hoare triple {35234#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 112: Hoare triple {35234#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 113: Hoare triple {35234#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 114: Hoare triple {35234#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 115: Hoare triple {35234#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 116: Hoare triple {35234#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,389 INFO L290 TraceCheckUtils]: 117: Hoare triple {35234#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 118: Hoare triple {35234#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 119: Hoare triple {35234#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 120: Hoare triple {35234#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 121: Hoare triple {35234#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 122: Hoare triple {35234#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 123: Hoare triple {35234#false} assume 8672 == #t~mem74;havoc #t~mem74; {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 124: Hoare triple {35234#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 125: Hoare triple {35234#false} assume 4 == ~blastFlag~0; {35234#false} is VALID [2022-04-08 15:14:40,390 INFO L290 TraceCheckUtils]: 126: Hoare triple {35234#false} assume !false; {35234#false} is VALID [2022-04-08 15:14:40,391 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 15:14:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:40,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262670830] [2022-04-08 15:14:40,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262670830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:40,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:40,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:40,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:40,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [236360752] [2022-04-08 15:14:40,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [236360752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:40,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:40,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:14:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186233012] [2022-04-08 15:14:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:40,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 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 127 [2022-04-08 15:14:40,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:40,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:40,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:40,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:14:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:40,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:14:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:14:40,472 INFO L87 Difference]: Start difference. First operand 314 states and 483 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:43,815 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 15:14:45,820 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 15:14:47,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:14:49,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:14:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:50,795 INFO L93 Difference]: Finished difference Result 609 states and 946 transitions. [2022-04-08 15:14:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:14:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 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 127 [2022-04-08 15:14:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-08 15:14:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2022-04-08 15:14:50,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 438 transitions. [2022-04-08 15:14:51,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:51,096 INFO L225 Difference]: With dead ends: 609 [2022-04-08 15:14:51,096 INFO L226 Difference]: Without dead ends: 321 [2022-04-08 15:14:51,097 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 15:14:51,097 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 30 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:51,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 504 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 365 Invalid, 3 Unknown, 0 Unchecked, 7.6s Time] [2022-04-08 15:14:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-08 15:14:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2022-04-08 15:14:51,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:51,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:51,112 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:51,113 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:51,119 INFO L93 Difference]: Finished difference Result 321 states and 492 transitions. [2022-04-08 15:14:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 492 transitions. [2022-04-08 15:14:51,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:51,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:51,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 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 321 states. [2022-04-08 15:14:51,120 INFO L87 Difference]: Start difference. First operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 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 321 states. [2022-04-08 15:14:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:51,126 INFO L93 Difference]: Finished difference Result 321 states and 492 transitions. [2022-04-08 15:14:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 492 transitions. [2022-04-08 15:14:51,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:51,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:51,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:51,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5469255663430421) internal successors, (478), 309 states have internal predecessors, (478), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 482 transitions. [2022-04-08 15:14:51,134 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 482 transitions. Word has length 127 [2022-04-08 15:14:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:51,135 INFO L478 AbstractCegarLoop]: Abstraction has 314 states and 482 transitions. [2022-04-08 15:14:51,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:51,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 314 states and 482 transitions. [2022-04-08 15:14:51,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 482 transitions. [2022-04-08 15:14:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 15:14:51,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:51,530 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, 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] [2022-04-08 15:14:51,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 15:14:51,530 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash 773095969, now seen corresponding path program 1 times [2022-04-08 15:14:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:51,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379492286] [2022-04-08 15:14:51,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:51,617 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash 773095969, now seen corresponding path program 2 times [2022-04-08 15:14:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:51,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469052249] [2022-04-08 15:14:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:51,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:51,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {37739#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {37733#true} is VALID [2022-04-08 15:14:51,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {37733#true} assume true; {37733#true} is VALID [2022-04-08 15:14:51,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37733#true} {37733#true} #664#return; {37733#true} is VALID [2022-04-08 15:14:51,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {37733#true} call ULTIMATE.init(); {37739#(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 15:14:51,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {37739#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {37733#true} is VALID [2022-04-08 15:14:51,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {37733#true} assume true; {37733#true} is VALID [2022-04-08 15:14:51,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37733#true} {37733#true} #664#return; {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {37733#true} call #t~ret162 := main(); {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {37733#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {37733#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L272 TraceCheckUtils]: 7: Hoare triple {37733#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {37733#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {37733#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {37733#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {37733#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {37733#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {37733#true} is VALID [2022-04-08 15:14:51,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {37733#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {37733#true} assume !false; {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {37733#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {37733#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {37733#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {37733#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {37733#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {37733#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {37733#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {37733#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {37733#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {37733#true} assume 8464 == #t~mem50;havoc #t~mem50; {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {37733#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {37733#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {37733#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {37733#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {37733#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {37733#true} ~skip~0 := 0; {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {37733#true} assume !false; {37733#true} is VALID [2022-04-08 15:14:51,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {37733#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {37733#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {37733#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {37733#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {37733#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {37733#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {37733#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {37733#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {37733#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {37733#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {37733#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {37733#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {37733#true} assume 8496 == #t~mem53;havoc #t~mem53; {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {37733#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {37733#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {37733#true} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {37733#true} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {37733#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {37733#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {37733#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {37733#true} is VALID [2022-04-08 15:14:51,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {37733#true} ~skip~0 := 0; {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {37733#true} assume !false; {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {37733#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {37733#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {37733#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {37733#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {37733#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {37733#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 60: Hoare triple {37733#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {37733#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {37733#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {37733#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {37733#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 65: Hoare triple {37733#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {37733#true} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {37733#true} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {37733#true} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {37733#true} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {37733#true} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {37733#true} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {37733#true} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {37733#true} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {37733#true} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {37733#true} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {37733#true} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {37733#true} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {37733#true} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 79: Hoare triple {37733#true} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 80: Hoare triple {37733#true} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {37733#true} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,754 INFO L290 TraceCheckUtils]: 82: Hoare triple {37733#true} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {37733#true} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {37733#true} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {37733#true} is VALID [2022-04-08 15:14:51,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {37733#true} assume 8656 == #t~mem72;havoc #t~mem72; {37733#true} is VALID [2022-04-08 15:14:51,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {37733#true} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {37733#true} is VALID [2022-04-08 15:14:51,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {37733#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {37733#true} is VALID [2022-04-08 15:14:51,756 INFO L290 TraceCheckUtils]: 88: Hoare triple {37733#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,756 INFO L290 TraceCheckUtils]: 89: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,756 INFO L290 TraceCheckUtils]: 90: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,757 INFO L290 TraceCheckUtils]: 92: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,757 INFO L290 TraceCheckUtils]: 93: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,758 INFO L290 TraceCheckUtils]: 94: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !false; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,758 INFO L290 TraceCheckUtils]: 95: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,759 INFO L290 TraceCheckUtils]: 97: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,759 INFO L290 TraceCheckUtils]: 98: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,759 INFO L290 TraceCheckUtils]: 99: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,760 INFO L290 TraceCheckUtils]: 100: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,760 INFO L290 TraceCheckUtils]: 101: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,760 INFO L290 TraceCheckUtils]: 102: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,761 INFO L290 TraceCheckUtils]: 103: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,761 INFO L290 TraceCheckUtils]: 104: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,761 INFO L290 TraceCheckUtils]: 105: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,761 INFO L290 TraceCheckUtils]: 106: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,762 INFO L290 TraceCheckUtils]: 107: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,762 INFO L290 TraceCheckUtils]: 108: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,762 INFO L290 TraceCheckUtils]: 109: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,763 INFO L290 TraceCheckUtils]: 110: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,763 INFO L290 TraceCheckUtils]: 111: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,763 INFO L290 TraceCheckUtils]: 112: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,764 INFO L290 TraceCheckUtils]: 113: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,764 INFO L290 TraceCheckUtils]: 114: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,764 INFO L290 TraceCheckUtils]: 115: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,765 INFO L290 TraceCheckUtils]: 116: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,765 INFO L290 TraceCheckUtils]: 117: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,765 INFO L290 TraceCheckUtils]: 118: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,765 INFO L290 TraceCheckUtils]: 119: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,766 INFO L290 TraceCheckUtils]: 120: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,766 INFO L290 TraceCheckUtils]: 121: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,766 INFO L290 TraceCheckUtils]: 122: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,767 INFO L290 TraceCheckUtils]: 123: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,767 INFO L290 TraceCheckUtils]: 124: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,767 INFO L290 TraceCheckUtils]: 125: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,768 INFO L290 TraceCheckUtils]: 126: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,768 INFO L290 TraceCheckUtils]: 127: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,768 INFO L290 TraceCheckUtils]: 128: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem74;havoc #t~mem74; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,769 INFO L290 TraceCheckUtils]: 129: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {37738#(<= 5 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:51,769 INFO L290 TraceCheckUtils]: 130: Hoare triple {37738#(<= 5 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0; {37734#false} is VALID [2022-04-08 15:14:51,769 INFO L290 TraceCheckUtils]: 131: Hoare triple {37734#false} assume !false; {37734#false} is VALID [2022-04-08 15:14:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 15:14:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:51,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469052249] [2022-04-08 15:14:51,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469052249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:51,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:51,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:51,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:51,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379492286] [2022-04-08 15:14:51,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379492286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:51,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:51,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663030747] [2022-04-08 15:14:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 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 15:14:51,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:51,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:51,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:51,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:14:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:14:51,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:14:51,852 INFO L87 Difference]: Start difference. First operand 314 states and 482 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:53,870 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 15:14:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:55,090 INFO L93 Difference]: Finished difference Result 890 states and 1386 transitions. [2022-04-08 15:14:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:14:55,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 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 15:14:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:14:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-08 15:14:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-04-08 15:14:55,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 586 transitions. [2022-04-08 15:14:55,484 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 15:14:55,507 INFO L225 Difference]: With dead ends: 890 [2022-04-08 15:14:55,507 INFO L226 Difference]: Without dead ends: 602 [2022-04-08 15:14:55,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:14:55,508 INFO L913 BasicCegarLoop]: 370 mSDtfsCounter, 143 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:14:55,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 565 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:14:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-04-08 15:14:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2022-04-08 15:14:55,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:14:55,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:55,687 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:55,687 INFO L87 Difference]: Start difference. First operand 602 states. Second operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:55,704 INFO L93 Difference]: Finished difference Result 602 states and 929 transitions. [2022-04-08 15:14:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 929 transitions. [2022-04-08 15:14:55,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:55,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:55,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 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 602 states. [2022-04-08 15:14:55,707 INFO L87 Difference]: Start difference. First operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 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 602 states. [2022-04-08 15:14:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:14:55,723 INFO L93 Difference]: Finished difference Result 602 states and 929 transitions. [2022-04-08 15:14:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 929 transitions. [2022-04-08 15:14:55,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:14:55,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:14:55,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:14:55,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:14:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 595 states have (on average 1.5529411764705883) internal successors, (924), 595 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 928 transitions. [2022-04-08 15:14:55,747 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 928 transitions. Word has length 132 [2022-04-08 15:14:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:14:55,747 INFO L478 AbstractCegarLoop]: Abstraction has 600 states and 928 transitions. [2022-04-08 15:14:55,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:14:55,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 600 states and 928 transitions. [2022-04-08 15:14:56,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 928 edges. 928 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:14:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 928 transitions. [2022-04-08 15:14:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 15:14:56,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:14:56,646 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, 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] [2022-04-08 15:14:56,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 15:14:56,646 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:14:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:14:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1276291873, now seen corresponding path program 1 times [2022-04-08 15:14:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:56,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499242993] [2022-04-08 15:14:56,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:14:56,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:14:56,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1276291873, now seen corresponding path program 2 times [2022-04-08 15:14:56,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:14:56,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942283972] [2022-04-08 15:14:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:14:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:14:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:14:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:14:56,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {41932#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {41926#true} is VALID [2022-04-08 15:14:56,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {41926#true} assume true; {41926#true} is VALID [2022-04-08 15:14:56,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41926#true} {41926#true} #664#return; {41926#true} is VALID [2022-04-08 15:14:56,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {41926#true} call ULTIMATE.init(); {41932#(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 15:14:56,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {41932#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {41926#true} is VALID [2022-04-08 15:14:56,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {41926#true} assume true; {41926#true} is VALID [2022-04-08 15:14:56,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41926#true} {41926#true} #664#return; {41926#true} is VALID [2022-04-08 15:14:56,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {41926#true} call #t~ret162 := main(); {41926#true} is VALID [2022-04-08 15:14:56,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {41926#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {41926#true} is VALID [2022-04-08 15:14:56,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {41926#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L272 TraceCheckUtils]: 7: Hoare triple {41926#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {41926#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {41926#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {41926#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {41926#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {41926#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {41926#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {41926#true} assume !false; {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {41926#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {41926#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {41926#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {41926#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {41926#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {41926#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {41926#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {41926#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {41926#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {41926#true} assume 8464 == #t~mem50;havoc #t~mem50; {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {41926#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {41926#true} is VALID [2022-04-08 15:14:56,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {41926#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {41926#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {41926#true} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {41926#true} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {41926#true} ~skip~0 := 0; {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {41926#true} assume !false; {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {41926#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {41926#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {41926#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {41926#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {41926#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {41926#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {41926#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {41926#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {41926#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {41926#true} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {41926#true} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {41926#true} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {41926#true} assume 8496 == #t~mem53;havoc #t~mem53; {41926#true} is VALID [2022-04-08 15:14:56,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {41926#true} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {41926#true} is VALID [2022-04-08 15:14:56,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {41926#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,884 INFO L290 TraceCheckUtils]: 64: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,885 INFO L290 TraceCheckUtils]: 67: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,886 INFO L290 TraceCheckUtils]: 68: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,886 INFO L290 TraceCheckUtils]: 69: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,887 INFO L290 TraceCheckUtils]: 72: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,887 INFO L290 TraceCheckUtils]: 73: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,888 INFO L290 TraceCheckUtils]: 74: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,888 INFO L290 TraceCheckUtils]: 75: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,888 INFO L290 TraceCheckUtils]: 76: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,889 INFO L290 TraceCheckUtils]: 77: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,889 INFO L290 TraceCheckUtils]: 78: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,889 INFO L290 TraceCheckUtils]: 79: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,890 INFO L290 TraceCheckUtils]: 80: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,890 INFO L290 TraceCheckUtils]: 81: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,890 INFO L290 TraceCheckUtils]: 82: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,891 INFO L290 TraceCheckUtils]: 83: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,891 INFO L290 TraceCheckUtils]: 84: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,891 INFO L290 TraceCheckUtils]: 85: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem72;havoc #t~mem72; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,892 INFO L290 TraceCheckUtils]: 86: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,892 INFO L290 TraceCheckUtils]: 87: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {41931#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:14:56,892 INFO L290 TraceCheckUtils]: 88: Hoare triple {41931#(= 2 ssl3_accept_~blastFlag~0)} assume !(2 == ~blastFlag~0); {41927#false} is VALID [2022-04-08 15:14:56,892 INFO L290 TraceCheckUtils]: 89: Hoare triple {41927#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 90: Hoare triple {41927#false} assume !(0 == ~tmp___10~0); {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 91: Hoare triple {41927#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 92: Hoare triple {41927#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 93: Hoare triple {41927#false} ~skip~0 := 0; {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 94: Hoare triple {41927#false} assume !false; {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 95: Hoare triple {41927#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 96: Hoare triple {41927#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 97: Hoare triple {41927#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 98: Hoare triple {41927#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,893 INFO L290 TraceCheckUtils]: 99: Hoare triple {41927#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 100: Hoare triple {41927#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 101: Hoare triple {41927#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 102: Hoare triple {41927#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 103: Hoare triple {41927#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 104: Hoare triple {41927#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 105: Hoare triple {41927#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 106: Hoare triple {41927#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 107: Hoare triple {41927#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 108: Hoare triple {41927#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,894 INFO L290 TraceCheckUtils]: 109: Hoare triple {41927#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 110: Hoare triple {41927#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 111: Hoare triple {41927#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 112: Hoare triple {41927#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 113: Hoare triple {41927#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 114: Hoare triple {41927#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 115: Hoare triple {41927#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 116: Hoare triple {41927#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 117: Hoare triple {41927#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 118: Hoare triple {41927#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,895 INFO L290 TraceCheckUtils]: 119: Hoare triple {41927#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 120: Hoare triple {41927#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 121: Hoare triple {41927#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 122: Hoare triple {41927#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 123: Hoare triple {41927#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 124: Hoare triple {41927#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 125: Hoare triple {41927#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 126: Hoare triple {41927#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 127: Hoare triple {41927#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 128: Hoare triple {41927#false} assume 8672 == #t~mem74;havoc #t~mem74; {41927#false} is VALID [2022-04-08 15:14:56,896 INFO L290 TraceCheckUtils]: 129: Hoare triple {41927#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {41927#false} is VALID [2022-04-08 15:14:56,897 INFO L290 TraceCheckUtils]: 130: Hoare triple {41927#false} assume 4 == ~blastFlag~0; {41927#false} is VALID [2022-04-08 15:14:56,897 INFO L290 TraceCheckUtils]: 131: Hoare triple {41927#false} assume !false; {41927#false} is VALID [2022-04-08 15:14:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:14:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:14:56,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942283972] [2022-04-08 15:14:56,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942283972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:56,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:56,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:56,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:14:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499242993] [2022-04-08 15:14:56,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499242993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:14:56,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:14:56,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:14:56,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018135987] [2022-04-08 15:14:56,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:14:56,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 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 15:14:56,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:14:56,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 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 15:14:57,003 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 15:14:57,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:14:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:14:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:14:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:14:57,004 INFO L87 Difference]: Start difference. First operand 600 states and 928 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 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 15:14:59,026 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 15:15:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:00,032 INFO L93 Difference]: Finished difference Result 1415 states and 2201 transitions. [2022-04-08 15:15:00,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:15:00,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 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 15:15:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 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 15:15:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-08 15:15:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 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 15:15:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-04-08 15:15:00,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-04-08 15:15:00,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:00,551 INFO L225 Difference]: With dead ends: 1415 [2022-04-08 15:15:00,552 INFO L226 Difference]: Without dead ends: 841 [2022-04-08 15:15:00,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:15:00,555 INFO L913 BasicCegarLoop]: 243 mSDtfsCounter, 138 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:00,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 438 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:15:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-08 15:15:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-04-08 15:15:00,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:00,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:00,736 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:00,737 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:00,762 INFO L93 Difference]: Finished difference Result 841 states and 1297 transitions. [2022-04-08 15:15:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1297 transitions. [2022-04-08 15:15:00,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:00,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:00,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 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 841 states. [2022-04-08 15:15:00,765 INFO L87 Difference]: Start difference. First operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 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 841 states. [2022-04-08 15:15:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:00,796 INFO L93 Difference]: Finished difference Result 841 states and 1297 transitions. [2022-04-08 15:15:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1297 transitions. [2022-04-08 15:15:00,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:00,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:00,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:00,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 836 states have (on average 1.5466507177033493) internal successors, (1293), 836 states have internal predecessors, (1293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1297 transitions. [2022-04-08 15:15:00,826 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1297 transitions. Word has length 132 [2022-04-08 15:15:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:00,826 INFO L478 AbstractCegarLoop]: Abstraction has 841 states and 1297 transitions. [2022-04-08 15:15:00,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 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 15:15:00,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1297 transitions. [2022-04-08 15:15:01,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1297 edges. 1297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1297 transitions. [2022-04-08 15:15:01,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 15:15:01,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:01,851 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, 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] [2022-04-08 15:15:01,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 15:15:01,851 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1060100637, now seen corresponding path program 1 times [2022-04-08 15:15:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843681866] [2022-04-08 15:15:01,950 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:01,951 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1060100637, now seen corresponding path program 2 times [2022-04-08 15:15:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:01,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207396398] [2022-04-08 15:15:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:02,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {48135#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {48129#true} is VALID [2022-04-08 15:15:02,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {48129#true} assume true; {48129#true} is VALID [2022-04-08 15:15:02,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48129#true} {48129#true} #664#return; {48129#true} is VALID [2022-04-08 15:15:02,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {48129#true} call ULTIMATE.init(); {48135#(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 15:15:02,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {48135#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {48129#true} is VALID [2022-04-08 15:15:02,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {48129#true} assume true; {48129#true} is VALID [2022-04-08 15:15:02,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48129#true} {48129#true} #664#return; {48129#true} is VALID [2022-04-08 15:15:02,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {48129#true} call #t~ret162 := main(); {48129#true} is VALID [2022-04-08 15:15:02,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {48129#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48129#true} is VALID [2022-04-08 15:15:02,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {48129#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {48129#true} is VALID [2022-04-08 15:15:02,067 INFO L272 TraceCheckUtils]: 7: Hoare triple {48129#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {48129#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {48129#true} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {48129#true} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {48129#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {48129#true} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {48129#true} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {48129#true} assume !false; {48129#true} is VALID [2022-04-08 15:15:02,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {48129#true} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {48129#true} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {48129#true} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {48129#true} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {48129#true} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {48129#true} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {48129#true} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {48129#true} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {48129#true} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48129#true} is VALID [2022-04-08 15:15:02,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {48129#true} assume 8464 == #t~mem50;havoc #t~mem50; {48129#true} is VALID [2022-04-08 15:15:02,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {48129#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {48129#true} is VALID [2022-04-08 15:15:02,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {48129#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !false; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem53;havoc #t~mem53; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {48134#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:15:02,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {48134#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {48130#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {48130#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {48130#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {48130#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {48130#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {48130#false} ~skip~0 := 0; {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {48130#false} assume !false; {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {48130#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {48130#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {48130#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {48130#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {48130#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 59: Hoare triple {48130#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {48130#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {48130#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {48130#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {48130#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {48130#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {48130#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {48130#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {48130#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {48130#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {48130#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {48130#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 71: Hoare triple {48130#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {48130#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 73: Hoare triple {48130#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {48130#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {48130#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {48130#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {48130#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {48130#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {48130#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {48130#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 81: Hoare triple {48130#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {48130#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {48130#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {48130#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {48130#false} assume 8656 == #t~mem72;havoc #t~mem72; {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {48130#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 87: Hoare triple {48130#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 88: Hoare triple {48130#false} assume !(2 == ~blastFlag~0); {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {48130#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 90: Hoare triple {48130#false} assume !(0 == ~tmp___10~0); {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 91: Hoare triple {48130#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 92: Hoare triple {48130#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 93: Hoare triple {48130#false} ~skip~0 := 0; {48130#false} is VALID [2022-04-08 15:15:02,081 INFO L290 TraceCheckUtils]: 94: Hoare triple {48130#false} assume !false; {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 95: Hoare triple {48130#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 96: Hoare triple {48130#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 97: Hoare triple {48130#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 98: Hoare triple {48130#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 99: Hoare triple {48130#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {48130#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 101: Hoare triple {48130#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 102: Hoare triple {48130#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 103: Hoare triple {48130#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,082 INFO L290 TraceCheckUtils]: 104: Hoare triple {48130#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 105: Hoare triple {48130#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 106: Hoare triple {48130#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 107: Hoare triple {48130#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 108: Hoare triple {48130#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 109: Hoare triple {48130#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 110: Hoare triple {48130#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 111: Hoare triple {48130#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 112: Hoare triple {48130#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 113: Hoare triple {48130#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,083 INFO L290 TraceCheckUtils]: 114: Hoare triple {48130#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 115: Hoare triple {48130#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 116: Hoare triple {48130#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 117: Hoare triple {48130#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 118: Hoare triple {48130#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 119: Hoare triple {48130#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 120: Hoare triple {48130#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 121: Hoare triple {48130#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 122: Hoare triple {48130#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,084 INFO L290 TraceCheckUtils]: 123: Hoare triple {48130#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 124: Hoare triple {48130#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 125: Hoare triple {48130#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 126: Hoare triple {48130#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 127: Hoare triple {48130#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 128: Hoare triple {48130#false} assume 8672 == #t~mem74;havoc #t~mem74; {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 129: Hoare triple {48130#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 130: Hoare triple {48130#false} assume 4 == ~blastFlag~0; {48130#false} is VALID [2022-04-08 15:15:02,085 INFO L290 TraceCheckUtils]: 131: Hoare triple {48130#false} assume !false; {48130#false} is VALID [2022-04-08 15:15:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 15:15:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207396398] [2022-04-08 15:15:02,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207396398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:02,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:02,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:15:02,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:02,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843681866] [2022-04-08 15:15:02,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843681866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:02,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:02,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:15:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606535341] [2022-04-08 15:15:02,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:02,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 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 15:15:02,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:02,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:02,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:02,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:15:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:15:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:15:02,163 INFO L87 Difference]: Start difference. First operand 841 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:04,183 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 15:15:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:05,189 INFO L93 Difference]: Finished difference Result 1683 states and 2601 transitions. [2022-04-08 15:15:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:15:05,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 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 15:15:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-08 15:15:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-08 15:15:05,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 434 transitions. [2022-04-08 15:15:05,488 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 15:15:05,518 INFO L225 Difference]: With dead ends: 1683 [2022-04-08 15:15:05,518 INFO L226 Difference]: Without dead ends: 868 [2022-04-08 15:15:05,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:15:05,519 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 15 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:05,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:15:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-04-08 15:15:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2022-04-08 15:15:05,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:05,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:05,692 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:05,692 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:05,714 INFO L93 Difference]: Finished difference Result 868 states and 1332 transitions. [2022-04-08 15:15:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1332 transitions. [2022-04-08 15:15:05,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:05,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:05,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 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 868 states. [2022-04-08 15:15:05,717 INFO L87 Difference]: Start difference. First operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 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 868 states. [2022-04-08 15:15:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:05,746 INFO L93 Difference]: Finished difference Result 868 states and 1332 transitions. [2022-04-08 15:15:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1332 transitions. [2022-04-08 15:15:05,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:05,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:05,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:05,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 863 states have (on average 1.5388180764774044) internal successors, (1328), 863 states have internal predecessors, (1328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1332 transitions. [2022-04-08 15:15:05,778 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1332 transitions. Word has length 132 [2022-04-08 15:15:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:05,778 INFO L478 AbstractCegarLoop]: Abstraction has 868 states and 1332 transitions. [2022-04-08 15:15:05,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:05,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 868 states and 1332 transitions. [2022-04-08 15:15:06,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1332 edges. 1332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1332 transitions. [2022-04-08 15:15:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 15:15:06,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:06,851 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, 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] [2022-04-08 15:15:06,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:15:06,851 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash 436819035, now seen corresponding path program 1 times [2022-04-08 15:15:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:06,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927198554] [2022-04-08 15:15:06,950 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:06,950 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash 436819035, now seen corresponding path program 2 times [2022-04-08 15:15:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:06,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043318834] [2022-04-08 15:15:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:06,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:07,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {54982#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {54976#true} is VALID [2022-04-08 15:15:07,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {54976#true} assume true; {54976#true} is VALID [2022-04-08 15:15:07,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54976#true} {54976#true} #664#return; {54976#true} is VALID [2022-04-08 15:15:07,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {54976#true} call ULTIMATE.init(); {54982#(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 15:15:07,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {54976#true} is VALID [2022-04-08 15:15:07,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {54976#true} assume true; {54976#true} is VALID [2022-04-08 15:15:07,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54976#true} {54976#true} #664#return; {54976#true} is VALID [2022-04-08 15:15:07,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {54976#true} call #t~ret162 := main(); {54976#true} is VALID [2022-04-08 15:15:07,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {54976#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {54976#true} is VALID [2022-04-08 15:15:07,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {54976#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {54976#true} is VALID [2022-04-08 15:15:07,064 INFO L272 TraceCheckUtils]: 7: Hoare triple {54976#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54976#true} is VALID [2022-04-08 15:15:07,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {54976#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !false; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem50;havoc #t~mem50; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {54981#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:15:07,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {54981#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {54977#false} is VALID [2022-04-08 15:15:07,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {54977#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {54977#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {54977#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {54977#false} is VALID [2022-04-08 15:15:07,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {54977#false} ~skip~0 := 0; {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {54977#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {54977#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {54977#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {54977#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {54977#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {54977#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {54977#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {54977#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {54977#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {54977#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {54977#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {54977#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {54977#false} assume 8496 == #t~mem53;havoc #t~mem53; {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {54977#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 46: Hoare triple {54977#false} assume !(1 == ~blastFlag~0); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 47: Hoare triple {54977#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 48: Hoare triple {54977#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {54977#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {54977#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {54977#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {54977#false} ~skip~0 := 0; {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {54977#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {54977#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {54977#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {54977#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {54977#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {54977#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {54977#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {54977#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {54977#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {54977#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {54977#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {54977#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {54977#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {54977#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {54977#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {54977#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {54977#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 71: Hoare triple {54977#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 72: Hoare triple {54977#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {54977#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 74: Hoare triple {54977#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {54977#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {54977#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {54977#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 78: Hoare triple {54977#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 79: Hoare triple {54977#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,075 INFO L290 TraceCheckUtils]: 80: Hoare triple {54977#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 81: Hoare triple {54977#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 82: Hoare triple {54977#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 83: Hoare triple {54977#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 84: Hoare triple {54977#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 85: Hoare triple {54977#false} assume 8656 == #t~mem72;havoc #t~mem72; {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 86: Hoare triple {54977#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 87: Hoare triple {54977#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 88: Hoare triple {54977#false} assume !(2 == ~blastFlag~0); {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 89: Hoare triple {54977#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {54977#false} is VALID [2022-04-08 15:15:07,076 INFO L290 TraceCheckUtils]: 90: Hoare triple {54977#false} assume !(0 == ~tmp___10~0); {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 91: Hoare triple {54977#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 92: Hoare triple {54977#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 93: Hoare triple {54977#false} ~skip~0 := 0; {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 94: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 95: Hoare triple {54977#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 96: Hoare triple {54977#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 97: Hoare triple {54977#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 98: Hoare triple {54977#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 99: Hoare triple {54977#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,077 INFO L290 TraceCheckUtils]: 100: Hoare triple {54977#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 101: Hoare triple {54977#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 102: Hoare triple {54977#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 103: Hoare triple {54977#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 104: Hoare triple {54977#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 105: Hoare triple {54977#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 106: Hoare triple {54977#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 107: Hoare triple {54977#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 108: Hoare triple {54977#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 109: Hoare triple {54977#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,078 INFO L290 TraceCheckUtils]: 110: Hoare triple {54977#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 111: Hoare triple {54977#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 112: Hoare triple {54977#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 113: Hoare triple {54977#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 114: Hoare triple {54977#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 115: Hoare triple {54977#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 116: Hoare triple {54977#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 117: Hoare triple {54977#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 118: Hoare triple {54977#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,079 INFO L290 TraceCheckUtils]: 119: Hoare triple {54977#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 120: Hoare triple {54977#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {54977#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 122: Hoare triple {54977#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 123: Hoare triple {54977#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 124: Hoare triple {54977#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 125: Hoare triple {54977#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 126: Hoare triple {54977#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 127: Hoare triple {54977#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {54977#false} is VALID [2022-04-08 15:15:07,080 INFO L290 TraceCheckUtils]: 128: Hoare triple {54977#false} assume 8672 == #t~mem74;havoc #t~mem74; {54977#false} is VALID [2022-04-08 15:15:07,081 INFO L290 TraceCheckUtils]: 129: Hoare triple {54977#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {54977#false} is VALID [2022-04-08 15:15:07,081 INFO L290 TraceCheckUtils]: 130: Hoare triple {54977#false} assume 4 == ~blastFlag~0; {54977#false} is VALID [2022-04-08 15:15:07,081 INFO L290 TraceCheckUtils]: 131: Hoare triple {54977#false} assume !false; {54977#false} is VALID [2022-04-08 15:15:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-08 15:15:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:07,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043318834] [2022-04-08 15:15:07,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043318834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:07,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:07,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:15:07,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:07,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927198554] [2022-04-08 15:15:07,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927198554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:07,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:07,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:15:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133275380] [2022-04-08 15:15:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:07,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-08 15:15:07,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:07,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:07,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:07,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:15:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:07,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:15:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:15:07,172 INFO L87 Difference]: Start difference. First operand 868 states and 1332 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:09,189 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 15:15:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:10,009 INFO L93 Difference]: Finished difference Result 1426 states and 2186 transitions. [2022-04-08 15:15:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:15:10,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-08 15:15:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-08 15:15:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-04-08 15:15:10,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 408 transitions. [2022-04-08 15:15:10,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:10,304 INFO L225 Difference]: With dead ends: 1426 [2022-04-08 15:15:10,305 INFO L226 Difference]: Without dead ends: 584 [2022-04-08 15:15:10,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:15:10,307 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 4 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:10,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 388 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:15:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-08 15:15:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-08 15:15:10,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:10,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,464 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,465 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:10,475 INFO L93 Difference]: Finished difference Result 584 states and 883 transitions. [2022-04-08 15:15:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2022-04-08 15:15:10,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:10,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:10,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 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 584 states. [2022-04-08 15:15:10,477 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 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 584 states. [2022-04-08 15:15:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:10,492 INFO L93 Difference]: Finished difference Result 584 states and 883 transitions. [2022-04-08 15:15:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2022-04-08 15:15:10,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:10,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:10,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:10,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5181347150259068) internal successors, (879), 579 states have internal predecessors, (879), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 883 transitions. [2022-04-08 15:15:10,511 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 883 transitions. Word has length 132 [2022-04-08 15:15:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:10,511 INFO L478 AbstractCegarLoop]: Abstraction has 584 states and 883 transitions. [2022-04-08 15:15:10,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:10,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 584 states and 883 transitions. [2022-04-08 15:15:11,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 883 edges. 883 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2022-04-08 15:15:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 15:15:11,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:11,252 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:11,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 15:15:11,252 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1803828749, now seen corresponding path program 1 times [2022-04-08 15:15:11,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:11,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252562238] [2022-04-08 15:15:11,357 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:11,357 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1803828749, now seen corresponding path program 2 times [2022-04-08 15:15:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:11,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532546998] [2022-04-08 15:15:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:15:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:15:11,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {60182#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {60173#true} is VALID [2022-04-08 15:15:11,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {60173#true} assume true; {60173#true} is VALID [2022-04-08 15:15:11,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60173#true} {60173#true} #664#return; {60173#true} is VALID [2022-04-08 15:15:11,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {60173#true} call ULTIMATE.init(); {60182#(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 15:15:11,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {60182#(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(196, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#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); {60173#true} is VALID [2022-04-08 15:15:11,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {60173#true} assume true; {60173#true} is VALID [2022-04-08 15:15:11,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60173#true} {60173#true} #664#return; {60173#true} is VALID [2022-04-08 15:15:11,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {60173#true} call #t~ret162 := main(); {60173#true} is VALID [2022-04-08 15:15:11,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {60173#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {60173#true} is VALID [2022-04-08 15:15:11,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {60173#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {60178#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-08 15:15:11,805 INFO L272 TraceCheckUtils]: 7: Hoare triple {60178#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {60179#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-08 15:15:11,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {60179#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet31 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet31 % 18446744073709551616 % 18446744073709551616 else #t~nondet31 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~nondet31;havoc ~l~0;havoc ~Time~0;assume -9223372036854775808 <= #t~nondet32 && #t~nondet32 <= 9223372036854775807;~tmp~3 := #t~nondet32;havoc #t~nondet32;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~nondet33 && #t~nondet33 <= 2147483647;~tmp___1~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___2~0 := #t~nondet34;havoc #t~nondet34;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet35 && #t~nondet35 <= 9223372036854775807;~tmp___8~0 := #t~nondet35;havoc #t~nondet35;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;call write~int(#t~nondet36, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet36;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~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~mem37.base, #t~mem37.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:11,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem37.base + #t~mem37.offset) % 18446744073709551616;havoc #t~mem37.base, #t~mem37.offset;call #t~mem38.base, #t~mem38.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem38.base, #t~mem38.offset;havoc #t~mem38.base, #t~mem38.offset; {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:11,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem39 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem39, ~s.base, 44 + ~s.offset, 4);havoc #t~mem39; {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:11,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:15:11,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {60180#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {60181#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} is VALID [2022-04-08 15:15:11,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {60181#(and (= |ssl3_accept_#t~mem40.base| 0) (= |ssl3_accept_#t~mem40.offset| 0))} assume !(0 == (#t~mem40.base + #t~mem40.offset) % 18446744073709551616);havoc #t~mem40.base, #t~mem40.offset; {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {60174#false} assume 8464 == #t~mem50;havoc #t~mem50; {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {60174#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {60174#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {60174#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {60174#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {60174#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {60174#false} ~skip~0 := 0; {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {60174#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {60174#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {60174#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {60174#false} assume 8496 == #t~mem53;havoc #t~mem53; {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {60174#false} assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {60174#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {60174#false} assume !(~ret~0 <= 0);call #t~mem91 := read~int(~s.base, 128 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {60174#false} assume 0 != #t~mem91;havoc #t~mem91;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {60174#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {60174#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {60174#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {60174#false} ~skip~0 := 0; {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-08 15:15:11,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 55: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 59: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 62: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {60174#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {60174#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {60174#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {60174#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 67: Hoare triple {60174#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {60174#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {60174#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {60174#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {60174#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {60174#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {60174#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {60174#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,816 INFO L290 TraceCheckUtils]: 75: Hoare triple {60174#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {60174#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {60174#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 78: Hoare triple {60174#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 79: Hoare triple {60174#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 80: Hoare triple {60174#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 81: Hoare triple {60174#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {60174#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 83: Hoare triple {60174#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {60174#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {60174#false} assume 8656 == #t~mem72;havoc #t~mem72; {60174#false} is VALID [2022-04-08 15:15:11,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {60174#false} call #t~mem139.base, #t~mem139.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(#t~mem140.base, 888 + #t~mem140.offset, 8);call write~$Pointer$(#t~mem141.base, #t~mem141.offset, #t~mem139.base, 192 + #t~mem139.offset, 8);havoc #t~mem139.base, #t~mem139.offset;havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;assume -2147483648 <= #t~nondet142 && #t~nondet142 <= 2147483647;~tmp___9~0 := #t~nondet142;havoc #t~nondet142; {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 87: Hoare triple {60174#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 88: Hoare triple {60174#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 5; {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {60174#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~tmp___10~0 := #t~nondet144;havoc #t~nondet144; {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 90: Hoare triple {60174#false} assume !(0 == ~tmp___10~0); {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 91: Hoare triple {60174#false} call #t~mem151.base, #t~mem151.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem152 := read~int(#t~mem151.base, 908 + #t~mem151.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 92: Hoare triple {60174#false} assume !(0 == #t~mem152);havoc #t~mem151.base, #t~mem151.offset;havoc #t~mem152; {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 93: Hoare triple {60174#false} ~skip~0 := 0; {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 94: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 95: Hoare triple {60174#false} call #t~mem41 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem41;havoc #t~mem41;call #t~mem42 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 96: Hoare triple {60174#false} assume !(12292 == #t~mem42);havoc #t~mem42;call #t~mem43 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,818 INFO L290 TraceCheckUtils]: 97: Hoare triple {60174#false} assume !(16384 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 98: Hoare triple {60174#false} assume !(8192 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 99: Hoare triple {60174#false} assume !(24576 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 100: Hoare triple {60174#false} assume !(8195 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 101: Hoare triple {60174#false} assume !(8480 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 102: Hoare triple {60174#false} assume !(8481 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 103: Hoare triple {60174#false} assume !(8482 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 104: Hoare triple {60174#false} assume !(8464 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 105: Hoare triple {60174#false} assume !(8465 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 106: Hoare triple {60174#false} assume !(8466 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,819 INFO L290 TraceCheckUtils]: 107: Hoare triple {60174#false} assume !(8496 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 108: Hoare triple {60174#false} assume !(8497 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 109: Hoare triple {60174#false} assume !(8512 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 110: Hoare triple {60174#false} assume !(8513 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 111: Hoare triple {60174#false} assume !(8528 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 112: Hoare triple {60174#false} assume !(8529 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 113: Hoare triple {60174#false} assume !(8544 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 114: Hoare triple {60174#false} assume !(8545 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 115: Hoare triple {60174#false} assume !(8560 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 116: Hoare triple {60174#false} assume !(8561 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 117: Hoare triple {60174#false} assume !(8448 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,820 INFO L290 TraceCheckUtils]: 118: Hoare triple {60174#false} assume !(8576 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 119: Hoare triple {60174#false} assume !(8577 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 120: Hoare triple {60174#false} assume !(8592 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 121: Hoare triple {60174#false} assume !(8593 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 122: Hoare triple {60174#false} assume !(8608 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 123: Hoare triple {60174#false} assume !(8609 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 124: Hoare triple {60174#false} assume !(8640 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 125: Hoare triple {60174#false} assume !(8641 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 126: Hoare triple {60174#false} assume !(8656 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 127: Hoare triple {60174#false} assume !(8657 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 128: Hoare triple {60174#false} assume 8672 == #t~mem74;havoc #t~mem74; {60174#false} is VALID [2022-04-08 15:15:11,821 INFO L290 TraceCheckUtils]: 129: Hoare triple {60174#false} assume -2147483648 <= #t~nondet145 && #t~nondet145 <= 2147483647;~ret~0 := #t~nondet145;havoc #t~nondet145; {60174#false} is VALID [2022-04-08 15:15:11,822 INFO L290 TraceCheckUtils]: 130: Hoare triple {60174#false} assume !(4 == ~blastFlag~0); {60174#false} is VALID [2022-04-08 15:15:11,822 INFO L290 TraceCheckUtils]: 131: Hoare triple {60174#false} assume 5 == ~blastFlag~0; {60174#false} is VALID [2022-04-08 15:15:11,822 INFO L290 TraceCheckUtils]: 132: Hoare triple {60174#false} assume !false; {60174#false} is VALID [2022-04-08 15:15:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-08 15:15:11,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:15:11,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532546998] [2022-04-08 15:15:11,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532546998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:11,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:11,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:15:11,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:15:11,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252562238] [2022-04-08 15:15:11,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252562238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:15:11,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:15:11,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:15:11,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719526747] [2022-04-08 15:15:11,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:15:11,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 133 [2022-04-08 15:15:11,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:15:11,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 15:15:11,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:11,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 15:15:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 15:15:11,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 15:15:11,907 INFO L87 Difference]: Start difference. First operand 584 states and 883 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 15:15:13,943 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 15:15:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:15,487 INFO L93 Difference]: Finished difference Result 1161 states and 1758 transitions. [2022-04-08 15:15:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 15:15:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 133 [2022-04-08 15:15:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:15:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 15:15:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-08 15:15:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 15:15:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 404 transitions. [2022-04-08 15:15:15,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 404 transitions. [2022-04-08 15:15:15,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:15,768 INFO L225 Difference]: With dead ends: 1161 [2022-04-08 15:15:15,768 INFO L226 Difference]: Without dead ends: 584 [2022-04-08 15:15:15,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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 15:15:15,769 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:15:15,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 796 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:15:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-08 15:15:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2022-04-08 15:15:15,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:15:15,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:15,929 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:15,930 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:15,940 INFO L93 Difference]: Finished difference Result 584 states and 882 transitions. [2022-04-08 15:15:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 882 transitions. [2022-04-08 15:15:15,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:15,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:15,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 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 584 states. [2022-04-08 15:15:15,941 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 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 584 states. [2022-04-08 15:15:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:15:15,957 INFO L93 Difference]: Finished difference Result 584 states and 882 transitions. [2022-04-08 15:15:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 882 transitions. [2022-04-08 15:15:15,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:15:15,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:15:15,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:15:15,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:15:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.5164075993091537) internal successors, (878), 579 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:15:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 882 transitions. [2022-04-08 15:15:15,980 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 882 transitions. Word has length 133 [2022-04-08 15:15:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:15:15,980 INFO L478 AbstractCegarLoop]: Abstraction has 584 states and 882 transitions. [2022-04-08 15:15:15,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 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 15:15:15,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 584 states and 882 transitions. [2022-04-08 15:15:16,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 882 edges. 882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:15:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 882 transitions. [2022-04-08 15:15:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 15:15:16,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:15:16,711 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:15:16,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 15:15:16,711 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:15:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:15:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2056632949, now seen corresponding path program 1 times [2022-04-08 15:15:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:15:16,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [766955111] [2022-04-08 15:15:16,793 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:15:16,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:15:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2056632949, now seen corresponding path program 2 times [2022-04-08 15:15:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:15:16,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688811660] [2022-04-08 15:15:16,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:15:16,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:15:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:15:17,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 15:15:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:15:17,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 15:15:17,472 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 15:15:17,472 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 15:15:17,477 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 15:15:17,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 15:15:17,481 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 15:15:17,484 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:15:17,532 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1747 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1145 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-08 15:15:17,533 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1747-1 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1145-2 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1151 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-08 15:15:17,534 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1151-1 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1160 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: L1166-2 has no Hoare annotation [2022-04-08 15:15:17,535 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-08 15:15:17,551 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1731 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1169 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1731-2 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1172 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1279 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1175 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1284 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1178 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1284-2 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-08 15:15:17,552 WARN L170 areAnnotationChecker]: L1181 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1289 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1184 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1295 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1187 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1297 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1295-2 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1334 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1190 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1308 has no Hoare annotation [2022-04-08 15:15:17,553 WARN L170 areAnnotationChecker]: L1658 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1193 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1315 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1196 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1317 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1696-1 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1199 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-08 15:15:17,554 WARN L170 areAnnotationChecker]: L1698 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1202 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1700 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1698-2 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1205 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1709 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1368 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1208 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1368-2 has no Hoare annotation [2022-04-08 15:15:17,555 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1211 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1378 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1214 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1378-2 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1387-2 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1391 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1217 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1220 has no Hoare annotation [2022-04-08 15:15:17,556 WARN L170 areAnnotationChecker]: L1403-2 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1223 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1450 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1226 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1426 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1411 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1451 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1229 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-08 15:15:17,557 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1414 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1452 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1492 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1232 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1414-1 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1415 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1461 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1235 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1418 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-08 15:15:17,558 WARN L170 areAnnotationChecker]: L1462 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1503 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1238 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1473 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1506 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1503-2 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1521 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1241 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-08 15:15:17,559 WARN L170 areAnnotationChecker]: L1420-2 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1526 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1244 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1530 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1542 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1247 has no Hoare annotation [2022-04-08 15:15:17,560 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1250 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1553 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1253 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1256 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1564 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1259 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-08 15:15:17,561 WARN L170 areAnnotationChecker]: L1564-2 has no Hoare annotation [2022-04-08 15:15:17,562 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-08 15:15:17,562 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-08 15:15:17,562 WARN L170 areAnnotationChecker]: L1262 has no Hoare annotation [2022-04-08 15:15:17,562 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1574 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1585 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1265 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1574-2 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1268 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-08 15:15:17,563 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1619 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1618 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1275 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1630 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1644 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1640-1 has no Hoare annotation [2022-04-08 15:15:17,564 WARN L170 areAnnotationChecker]: L1630-2 has no Hoare annotation [2022-04-08 15:15:17,564 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 15:15:17,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:15:17 BoogieIcfgContainer [2022-04-08 15:15:17,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 15:15:17,569 INFO L158 Benchmark]: Toolchain (without parser) took 134699.19ms. Allocated memory was 189.8MB in the beginning and 285.2MB in the end (delta: 95.4MB). Free memory was 137.1MB in the beginning and 240.6MB in the end (delta: -103.5MB). Peak memory consumption was 153.9MB. Max. memory is 8.0GB. [2022-04-08 15:15:17,569 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory was 155.5MB in the beginning and 155.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 15:15:17,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 637.13ms. Allocated memory was 189.8MB in the beginning and 237.0MB in the end (delta: 47.2MB). Free memory was 136.9MB in the beginning and 190.6MB in the end (delta: -53.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-08 15:15:17,571 INFO L158 Benchmark]: Boogie Preprocessor took 144.29ms. Allocated memory is still 237.0MB. Free memory was 190.6MB in the beginning and 180.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 15:15:17,571 INFO L158 Benchmark]: RCFGBuilder took 2545.68ms. Allocated memory is still 237.0MB. Free memory was 180.6MB in the beginning and 160.3MB in the end (delta: 20.3MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2022-04-08 15:15:17,575 INFO L158 Benchmark]: TraceAbstraction took 131365.90ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 159.8MB in the beginning and 240.6MB in the end (delta: -80.8MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. [2022-04-08 15:15:17,578 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory was 155.5MB in the beginning and 155.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 637.13ms. Allocated memory was 189.8MB in the beginning and 237.0MB in the end (delta: 47.2MB). Free memory was 136.9MB in the beginning and 190.6MB in the end (delta: -53.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 144.29ms. Allocated memory is still 237.0MB. Free memory was 190.6MB in the beginning and 180.6MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2545.68ms. Allocated memory is still 237.0MB. Free memory was 180.6MB in the beginning and 160.3MB in the end (delta: 20.3MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. * TraceAbstraction took 131365.90ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 159.8MB in the beginning and 240.6MB in the end (delta: -80.8MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) [L1160] EXPR s->cert [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 [L1373] COND FALSE !(ret <= 0) [L1378] s->hit [L1378] COND TRUE s->hit [L1379] s->state = 8656 [L1383] s->init_num = 0 [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 [L1166] COND TRUE 1 [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) [L1618] COND TRUE blastFlag == 5 [L1737] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 131.2s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 110.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 31 mSolverCounterUnknown, 1679 SdHoareTripleChecker+Valid, 75.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1679 mSDsluCounter, 12236 SdHoareTripleChecker+Invalid, 75.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7391 mSDsCounter, 630 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10434 IncrementalHoareTripleChecker+Invalid, 11095 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 630 mSolverCounterUnsat, 4845 mSDtfsCounter, 10434 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=25, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 922 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-08 15:15:17,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...