/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:45:02,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:45:02,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:45:02,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:45:02,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:45:02,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:45:02,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:45:02,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:45:02,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:45:02,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:45:02,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:45:02,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:45:02,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:45:02,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:45:02,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:45:02,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:45:02,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:45:02,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:45:02,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:45:02,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:45:02,601 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:45:02,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:45:02,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:45:02,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:45:02,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:45:02,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:45:02,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:45:02,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:45:02,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:45:02,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:45:02,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:45:02,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:45:02,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:45:02,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:45:02,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:45:02,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:45:02,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:45:02,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:45:02,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:45:02,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:45:02,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:45:02,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:45:02,627 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:45:02,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:45:02,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:45:02,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:45:02,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:45:02,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:45:02,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:45:02,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:45:02,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:45:02,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:45:02,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:45:02,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:45:02,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:45:02,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:45:02,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:45:02,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:45:02,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:45:02,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:45:02,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:45:02,640 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:45:02,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:45:02,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:45:02,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:45:02,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:45:02,876 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:45:02,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c [2022-04-08 08:45:02,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f79cc6e/af59a720a7d046bbb886f34ea501cc21/FLAG20393e404 [2022-04-08 08:45:03,390 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:45:03,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-2.c [2022-04-08 08:45:03,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f79cc6e/af59a720a7d046bbb886f34ea501cc21/FLAG20393e404 [2022-04-08 08:45:03,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f79cc6e/af59a720a7d046bbb886f34ea501cc21 [2022-04-08 08:45:03,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:45:03,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:45:03,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:45:03,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:45:03,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:45:03,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:03,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7656d695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03, skipping insertion in model container [2022-04-08 08:45:03,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:03,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:45:03,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:45:03,784 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.14.i.cil-2.c[76259,76272] [2022-04-08 08:45:03,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:45:03,816 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:45:03,901 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.14.i.cil-2.c[76259,76272] [2022-04-08 08:45:03,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:45:03,916 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:45:03,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03 WrapperNode [2022-04-08 08:45:03,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:45:03,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:45:03,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:45:03,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:45:03,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:03,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:03,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:03,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:04,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:04,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:04,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:04,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:45:04,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:45:04,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:45:04,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:45:04,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (1/1) ... [2022-04-08 08:45:04,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:45:04,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:45:04,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:45:04,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:45:04,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:45:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:45:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:45:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:45:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:45:04,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:45:04,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:45:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:45:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:45:04,124 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:45:04,124 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:45:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:45:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:45:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:45:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:45:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:45:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:45:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:45:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:45:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:45:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:45:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:45:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:45:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:45:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:45:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:45:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:45:04,287 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:45:04,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:45:05,092 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:45:05,525 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:45:05,525 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:45:05,535 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:45:05,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:45:05,545 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:45:05,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:45:05 BoogieIcfgContainer [2022-04-08 08:45:05,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:45:05,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:45:05,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:45:05,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:45:05,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:45:03" (1/3) ... [2022-04-08 08:45:05,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3603ea3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:45:05, skipping insertion in model container [2022-04-08 08:45:05,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:45:03" (2/3) ... [2022-04-08 08:45:05,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3603ea3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:45:05, skipping insertion in model container [2022-04-08 08:45:05,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:45:05" (3/3) ... [2022-04-08 08:45:05,552 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2022-04-08 08:45:05,555 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:45:05,556 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:45:05,581 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:45:05,585 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:45:05,586 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:45:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 155 states have (on average 1.7161290322580645) internal successors, (266), 156 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:45:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 08:45:05,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:05,607 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] [2022-04-08 08:45:05,608 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1492919843, now seen corresponding path program 1 times [2022-04-08 08:45:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:05,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915227] [2022-04-08 08:45:05,623 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:45:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1492919843, now seen corresponding path program 2 times [2022-04-08 08:45:05,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:05,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977369757] [2022-04-08 08:45:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:05,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:06,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {166#true} is VALID [2022-04-08 08:45:06,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-08 08:45:06,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #720#return; {166#true} is VALID [2022-04-08 08:45:06,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:06,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {166#true} is VALID [2022-04-08 08:45:06,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} assume true; {166#true} is VALID [2022-04-08 08:45:06,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} #720#return; {166#true} is VALID [2022-04-08 08:45:06,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} call #t~ret161 := main(); {166#true} is VALID [2022-04-08 08:45:06,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {166#true} is VALID [2022-04-08 08:45:06,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {166#true} is VALID [2022-04-08 08:45:06,063 INFO L272 TraceCheckUtils]: 7: Hoare triple {166#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {166#true} is VALID [2022-04-08 08:45:06,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:06,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {171#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {172#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:45:06,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {172#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {167#false} is VALID [2022-04-08 08:45:06,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {167#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {167#false} is VALID [2022-04-08 08:45:06,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {167#false} assume !(9 == ~blastFlag~0); {167#false} is VALID [2022-04-08 08:45:06,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {167#false} assume !(12 == ~blastFlag~0); {167#false} is VALID [2022-04-08 08:45:06,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-08 08:45:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:06,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:06,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977369757] [2022-04-08 08:45:06,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977369757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:06,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:06,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:06,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:06,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915227] [2022-04-08 08:45:06,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:06,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:06,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40768514] [2022-04-08 08:45:06,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:06,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 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 49 [2022-04-08 08:45:06,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:06,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:06,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:06,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:06,171 INFO L87 Difference]: Start difference. First operand has 163 states, 155 states have (on average 1.7161290322580645) internal successors, (266), 156 states have internal predecessors, (266), 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.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:09,922 INFO L93 Difference]: Finished difference Result 445 states and 756 transitions. [2022-04-08 08:45:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 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 49 [2022-04-08 08:45:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2022-04-08 08:45:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2022-04-08 08:45:09,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 756 transitions. [2022-04-08 08:45:10,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 756 edges. 756 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:10,492 INFO L225 Difference]: With dead ends: 445 [2022-04-08 08:45:10,492 INFO L226 Difference]: Without dead ends: 271 [2022-04-08 08:45:10,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:10,497 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 164 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:10,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 491 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 08:45:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-08 08:45:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 187. [2022-04-08 08:45:10,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:10,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:10,529 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:10,530 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:10,539 INFO L93 Difference]: Finished difference Result 271 states and 419 transitions. [2022-04-08 08:45:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2022-04-08 08:45:10,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:10,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:10,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 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 271 states. [2022-04-08 08:45:10,542 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 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 271 states. [2022-04-08 08:45:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:10,550 INFO L93 Difference]: Finished difference Result 271 states and 419 transitions. [2022-04-08 08:45:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2022-04-08 08:45:10,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:10,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:10,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:10,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.6153846153846154) internal successors, (294), 182 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 298 transitions. [2022-04-08 08:45:10,559 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 298 transitions. Word has length 49 [2022-04-08 08:45:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:10,559 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 298 transitions. [2022-04-08 08:45:10,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:10,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 298 transitions. [2022-04-08 08:45:10,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 298 transitions. [2022-04-08 08:45:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 08:45:10,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:10,752 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:10,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:45:10,753 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:10,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash 723852413, now seen corresponding path program 1 times [2022-04-08 08:45:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:10,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1220060746] [2022-04-08 08:45:10,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:45:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash 723852413, now seen corresponding path program 2 times [2022-04-08 08:45:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:10,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482877407] [2022-04-08 08:45:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:10,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:10,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {1991#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {1984#true} is VALID [2022-04-08 08:45:10,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 08:45:10,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1984#true} {1984#true} #720#return; {1984#true} is VALID [2022-04-08 08:45:10,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1984#true} call ULTIMATE.init(); {1991#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:10,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1991#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {1984#true} is VALID [2022-04-08 08:45:10,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2022-04-08 08:45:10,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #720#return; {1984#true} is VALID [2022-04-08 08:45:10,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {1984#true} call #t~ret161 := main(); {1984#true} is VALID [2022-04-08 08:45:10,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {1984#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1984#true} is VALID [2022-04-08 08:45:10,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {1984#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1984#true} is VALID [2022-04-08 08:45:10,979 INFO L272 TraceCheckUtils]: 7: Hoare triple {1984#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1984#true} is VALID [2022-04-08 08:45:10,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {1984#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:10,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {1989#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1990#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:45:10,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {1990#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {1985#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {1985#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {1985#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {1985#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {1985#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {1985#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {1985#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {1985#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {1985#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {1985#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {1985#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {1985#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {1985#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {1985#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {1985#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {1985#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,997 INFO L290 TraceCheckUtils]: 41: Hoare triple {1985#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {1985#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:10,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {1985#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:11,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {1985#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1985#false} is VALID [2022-04-08 08:45:11,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {1985#false} assume 8641 == #t~mem76;havoc #t~mem76; {1985#false} is VALID [2022-04-08 08:45:11,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {1985#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1985#false} is VALID [2022-04-08 08:45:11,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {1985#false} assume !(9 == ~blastFlag~0); {1985#false} is VALID [2022-04-08 08:45:11,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {1985#false} assume !(12 == ~blastFlag~0); {1985#false} is VALID [2022-04-08 08:45:11,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2022-04-08 08:45:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:11,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:11,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482877407] [2022-04-08 08:45:11,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482877407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:11,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:11,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:11,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:11,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1220060746] [2022-04-08 08:45:11,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1220060746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:11,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:11,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:11,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326806720] [2022-04-08 08:45:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:45:11,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:11,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:11,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:11,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:11,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:11,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:11,051 INFO L87 Difference]: Start difference. First operand 187 states and 298 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:15,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:16,245 INFO L93 Difference]: Finished difference Result 387 states and 618 transitions. [2022-04-08 08:45:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:45:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 08:45:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 08:45:16,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-08 08:45:16,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:16,548 INFO L225 Difference]: With dead ends: 387 [2022-04-08 08:45:16,548 INFO L226 Difference]: Without dead ends: 215 [2022-04-08 08:45:16,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:16,550 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 22 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:16,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 511 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:45:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-08 08:45:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2022-04-08 08:45:16,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:16,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:16,562 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:16,563 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:16,568 INFO L93 Difference]: Finished difference Result 215 states and 338 transitions. [2022-04-08 08:45:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 338 transitions. [2022-04-08 08:45:16,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:16,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:16,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 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 215 states. [2022-04-08 08:45:16,569 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 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 215 states. [2022-04-08 08:45:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:16,574 INFO L93 Difference]: Finished difference Result 215 states and 338 transitions. [2022-04-08 08:45:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 338 transitions. [2022-04-08 08:45:16,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:16,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:16,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:16,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.621761658031088) internal successors, (313), 193 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 317 transitions. [2022-04-08 08:45:16,581 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 317 transitions. Word has length 50 [2022-04-08 08:45:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:16,581 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 317 transitions. [2022-04-08 08:45:16,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:16,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 317 transitions. [2022-04-08 08:45:16,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 317 transitions. [2022-04-08 08:45:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:45:16,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:16,793 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:16,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:45:16,793 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash -196136314, now seen corresponding path program 1 times [2022-04-08 08:45:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:16,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [692281281] [2022-04-08 08:45:16,836 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:16,837 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:16,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash -196136314, now seen corresponding path program 2 times [2022-04-08 08:45:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:16,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632655980] [2022-04-08 08:45:16,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:16,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:16,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {3603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {3596#true} is VALID [2022-04-08 08:45:16,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-08 08:45:16,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3596#true} {3596#true} #720#return; {3596#true} is VALID [2022-04-08 08:45:16,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {3596#true} call ULTIMATE.init(); {3603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:16,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {3603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {3596#true} is VALID [2022-04-08 08:45:16,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {3596#true} assume true; {3596#true} is VALID [2022-04-08 08:45:16,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3596#true} {3596#true} #720#return; {3596#true} is VALID [2022-04-08 08:45:16,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {3596#true} call #t~ret161 := main(); {3596#true} is VALID [2022-04-08 08:45:16,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {3596#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3596#true} is VALID [2022-04-08 08:45:16,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {3596#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3596#true} is VALID [2022-04-08 08:45:16,970 INFO L272 TraceCheckUtils]: 7: Hoare triple {3596#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3596#true} is VALID [2022-04-08 08:45:16,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {3596#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:16,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3602#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 08:45:16,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {3602#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {3597#false} is VALID [2022-04-08 08:45:16,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {3597#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {3597#false} is VALID [2022-04-08 08:45:16,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {3597#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {3597#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {3597#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {3597#false} ~skip~0 := 0; {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {3597#false} assume !false; {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {3597#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {3597#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {3597#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {3597#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {3597#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {3597#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {3597#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {3597#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {3597#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {3597#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {3597#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {3597#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 40: Hoare triple {3597#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {3597#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {3597#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {3597#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {3597#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {3597#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {3597#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {3597#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {3597#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {3597#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {3597#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {3597#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {3597#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {3597#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {3597#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {3597#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {3597#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {3597#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3597#false} is VALID [2022-04-08 08:45:16,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {3597#false} assume 8641 == #t~mem76;havoc #t~mem76; {3597#false} is VALID [2022-04-08 08:45:16,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {3597#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3597#false} is VALID [2022-04-08 08:45:16,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {3597#false} assume !(9 == ~blastFlag~0); {3597#false} is VALID [2022-04-08 08:45:16,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {3597#false} assume !(12 == ~blastFlag~0); {3597#false} is VALID [2022-04-08 08:45:16,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {3597#false} assume !false; {3597#false} is VALID [2022-04-08 08:45:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:16,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632655980] [2022-04-08 08:45:16,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632655980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:16,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:16,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:16,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:16,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [692281281] [2022-04-08 08:45:16,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [692281281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:16,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:16,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470930590] [2022-04-08 08:45:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:45:16,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:16,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:17,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:17,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:17,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:17,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:17,038 INFO L87 Difference]: Start difference. First operand 198 states and 317 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:19,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:22,825 INFO L93 Difference]: Finished difference Result 387 states and 617 transitions. [2022-04-08 08:45:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:45:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 08:45:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 08:45:22,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-08 08:45:23,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:23,140 INFO L225 Difference]: With dead ends: 387 [2022-04-08 08:45:23,140 INFO L226 Difference]: Without dead ends: 215 [2022-04-08 08:45:23,141 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:23,142 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:23,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 513 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 08:45:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-08 08:45:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2022-04-08 08:45:23,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:23,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 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 08:45:23,150 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 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 08:45:23,151 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 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 08:45:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:23,155 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2022-04-08 08:45:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 337 transitions. [2022-04-08 08:45:23,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:23,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:23,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 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 215 states. [2022-04-08 08:45:23,156 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 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 215 states. [2022-04-08 08:45:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:23,159 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2022-04-08 08:45:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 337 transitions. [2022-04-08 08:45:23,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:23,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:23,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:23,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.616580310880829) internal successors, (312), 193 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 08:45:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 316 transitions. [2022-04-08 08:45:23,163 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 316 transitions. Word has length 63 [2022-04-08 08:45:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:23,163 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 316 transitions. [2022-04-08 08:45:23,163 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:23,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 316 transitions. [2022-04-08 08:45:23,359 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 08:45:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 316 transitions. [2022-04-08 08:45:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:23,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:23,360 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:23,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:45:23,360 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:23,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2113932086, now seen corresponding path program 1 times [2022-04-08 08:45:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:23,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1678130588] [2022-04-08 08:45:23,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:23,386 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:23,386 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:23,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2113932086, now seen corresponding path program 2 times [2022-04-08 08:45:23,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:23,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42802629] [2022-04-08 08:45:23,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:23,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {5215#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {5208#true} is VALID [2022-04-08 08:45:23,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {5208#true} assume true; {5208#true} is VALID [2022-04-08 08:45:23,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5208#true} {5208#true} #720#return; {5208#true} is VALID [2022-04-08 08:45:23,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {5208#true} call ULTIMATE.init(); {5215#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:23,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {5215#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {5208#true} is VALID [2022-04-08 08:45:23,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {5208#true} assume true; {5208#true} is VALID [2022-04-08 08:45:23,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5208#true} {5208#true} #720#return; {5208#true} is VALID [2022-04-08 08:45:23,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {5208#true} call #t~ret161 := main(); {5208#true} is VALID [2022-04-08 08:45:23,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {5208#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5208#true} is VALID [2022-04-08 08:45:23,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {5208#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5208#true} is VALID [2022-04-08 08:45:23,512 INFO L272 TraceCheckUtils]: 7: Hoare triple {5208#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5208#true} is VALID [2022-04-08 08:45:23,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {5208#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:23,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {5213#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5214#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:45:23,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {5214#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {5209#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {5209#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {5209#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {5209#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {5209#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {5209#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {5209#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {5209#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {5209#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {5209#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {5209#false} ~skip~0 := 0; {5209#false} is VALID [2022-04-08 08:45:23,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {5209#false} assume !false; {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {5209#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {5209#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {5209#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {5209#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {5209#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {5209#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {5209#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {5209#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {5209#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {5209#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {5209#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {5209#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {5209#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {5209#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {5209#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {5209#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {5209#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {5209#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {5209#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {5209#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {5209#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {5209#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {5209#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {5209#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {5209#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {5209#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {5209#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {5209#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {5209#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {5209#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {5209#false} assume 8641 == #t~mem76;havoc #t~mem76; {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {5209#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {5209#false} assume !(9 == ~blastFlag~0); {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {5209#false} assume !(12 == ~blastFlag~0); {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {5209#false} assume !false; {5209#false} is VALID [2022-04-08 08:45:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:23,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42802629] [2022-04-08 08:45:23,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42802629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:23,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:23,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:23,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:23,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1678130588] [2022-04-08 08:45:23,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1678130588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:23,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:23,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310554574] [2022-04-08 08:45:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:23,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:23,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:23,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:23,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:23,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:23,563 INFO L87 Difference]: Start difference. First operand 198 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:28,264 INFO L93 Difference]: Finished difference Result 386 states and 615 transitions. [2022-04-08 08:45:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2022-04-08 08:45:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2022-04-08 08:45:28,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 469 transitions. [2022-04-08 08:45:28,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:28,549 INFO L225 Difference]: With dead ends: 386 [2022-04-08 08:45:28,549 INFO L226 Difference]: Without dead ends: 214 [2022-04-08 08:45:28,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:28,550 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 28 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:28,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 515 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 08:45:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-08 08:45:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2022-04-08 08:45:28,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:28,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,557 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,558 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:28,561 INFO L93 Difference]: Finished difference Result 214 states and 335 transitions. [2022-04-08 08:45:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 335 transitions. [2022-04-08 08:45:28,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:28,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:28,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 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 08:45:28,562 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 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 08:45:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:28,565 INFO L93 Difference]: Finished difference Result 214 states and 335 transitions. [2022-04-08 08:45:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 335 transitions. [2022-04-08 08:45:28,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:28,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:28,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:28,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.61139896373057) internal successors, (311), 193 states have internal predecessors, (311), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2022-04-08 08:45:28,578 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 64 [2022-04-08 08:45:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:28,578 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2022-04-08 08:45:28,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:28,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 315 transitions. [2022-04-08 08:45:28,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2022-04-08 08:45:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:28,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:28,773 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:28,773 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:45:28,773 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:28,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash -294131766, now seen corresponding path program 1 times [2022-04-08 08:45:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:28,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1392503260] [2022-04-08 08:45:28,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:28,933 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695712, now seen corresponding path program 1 times [2022-04-08 08:45:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:28,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451950094] [2022-04-08 08:45:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:29,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:29,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {6825#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {6816#true} is VALID [2022-04-08 08:45:29,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-08 08:45:29,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6816#true} {6816#true} #720#return; {6816#true} is VALID [2022-04-08 08:45:29,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {6816#true} call ULTIMATE.init(); {6825#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:29,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {6825#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {6816#true} is VALID [2022-04-08 08:45:29,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-08 08:45:29,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6816#true} {6816#true} #720#return; {6816#true} is VALID [2022-04-08 08:45:29,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {6816#true} call #t~ret161 := main(); {6816#true} is VALID [2022-04-08 08:45:29,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6816#true} is VALID [2022-04-08 08:45:29,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {6816#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6821#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-08 08:45:29,359 INFO L272 TraceCheckUtils]: 7: Hoare triple {6821#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6822#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-08 08:45:29,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {6822#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-08 08:45:29,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {6823#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6824#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 08:45:29,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {6824#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6817#false} is VALID [2022-04-08 08:45:29,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {6817#false} [726] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_257|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {6817#false} is VALID [2022-04-08 08:45:29,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {6817#false} [725] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6817#false} is VALID [2022-04-08 08:45:29,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {6817#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {6817#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {6817#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {6817#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {6817#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {6817#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {6817#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {6817#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {6817#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {6817#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {6817#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {6817#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {6817#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {6817#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {6817#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {6817#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {6817#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {6817#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {6817#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {6817#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {6817#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {6817#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {6817#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {6817#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {6817#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {6817#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {6817#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {6817#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {6817#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {6817#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6817#false} is VALID [2022-04-08 08:45:29,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {6817#false} assume 8641 == #t~mem76;havoc #t~mem76; {6817#false} is VALID [2022-04-08 08:45:29,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {6817#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6817#false} is VALID [2022-04-08 08:45:29,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {6817#false} assume !(9 == ~blastFlag~0); {6817#false} is VALID [2022-04-08 08:45:29,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {6817#false} assume !(12 == ~blastFlag~0); {6817#false} is VALID [2022-04-08 08:45:29,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {6817#false} assume !false; {6817#false} is VALID [2022-04-08 08:45:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:29,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:29,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451950094] [2022-04-08 08:45:29,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451950094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:29,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:29,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:45:29,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:29,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1392503260] [2022-04-08 08:45:29,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1392503260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:29,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:29,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:45:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082944540] [2022-04-08 08:45:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:29,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:29,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:29,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:29,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:45:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:45:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:45:29,415 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:31,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:33,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:36,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:38,326 INFO L93 Difference]: Finished difference Result 389 states and 622 transitions. [2022-04-08 08:45:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:45:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 442 transitions. [2022-04-08 08:45:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 442 transitions. [2022-04-08 08:45:38,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 442 transitions. [2022-04-08 08:45:38,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:38,607 INFO L225 Difference]: With dead ends: 389 [2022-04-08 08:45:38,607 INFO L226 Difference]: Without dead ends: 198 [2022-04-08 08:45:38,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:45:38,608 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 7 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:38,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 891 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 08:45:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-08 08:45:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-04-08 08:45:38,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:38,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 198 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:38,614 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 198 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:38,614 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 198 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:38,617 INFO L93 Difference]: Finished difference Result 198 states and 314 transitions. [2022-04-08 08:45:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2022-04-08 08:45:38,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:38,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:38,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 3 states have call successors, (3), 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 198 states. [2022-04-08 08:45:38,618 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 3 states have call successors, (3), 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 198 states. [2022-04-08 08:45:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:38,621 INFO L93 Difference]: Finished difference Result 198 states and 314 transitions. [2022-04-08 08:45:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2022-04-08 08:45:38,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:38,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:38,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:38,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 314 transitions. [2022-04-08 08:45:38,625 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 314 transitions. Word has length 64 [2022-04-08 08:45:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:38,625 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 314 transitions. [2022-04-08 08:45:38,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:38,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 314 transitions. [2022-04-08 08:45:38,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2022-04-08 08:45:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:38,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:38,839 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:38,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:45:38,839 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 139597320, now seen corresponding path program 1 times [2022-04-08 08:45:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:38,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198907766] [2022-04-08 08:45:38,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:38,966 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash -695044638, now seen corresponding path program 1 times [2022-04-08 08:45:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:38,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793405469] [2022-04-08 08:45:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:45:39,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:45:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:45:39,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:45:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 139597320, now seen corresponding path program 2 times [2022-04-08 08:45:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388350258] [2022-04-08 08:45:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:39,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {8411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {8404#true} is VALID [2022-04-08 08:45:39,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {8404#true} assume true; {8404#true} is VALID [2022-04-08 08:45:39,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8404#true} {8404#true} #720#return; {8404#true} is VALID [2022-04-08 08:45:39,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {8404#true} call ULTIMATE.init(); {8411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:39,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {8411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {8404#true} is VALID [2022-04-08 08:45:39,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {8404#true} assume true; {8404#true} is VALID [2022-04-08 08:45:39,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8404#true} {8404#true} #720#return; {8404#true} is VALID [2022-04-08 08:45:39,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {8404#true} call #t~ret161 := main(); {8404#true} is VALID [2022-04-08 08:45:39,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {8404#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8404#true} is VALID [2022-04-08 08:45:39,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {8404#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {8404#true} is VALID [2022-04-08 08:45:39,433 INFO L272 TraceCheckUtils]: 7: Hoare triple {8404#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8404#true} is VALID [2022-04-08 08:45:39,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {8404#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {8409#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8410#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {8410#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {8405#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {8405#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {8405#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {8405#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {8405#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {8405#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {8405#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {8405#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {8405#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8405#false} is VALID [2022-04-08 08:45:39,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {8405#false} ~skip~0 := 0; {8405#false} is VALID [2022-04-08 08:45:39,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {8405#false} assume !false; {8405#false} is VALID [2022-04-08 08:45:39,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {8405#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {8405#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {8405#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {8405#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {8405#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {8405#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {8405#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {8405#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {8405#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {8405#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {8405#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {8405#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {8405#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {8405#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {8405#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {8405#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {8405#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {8405#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {8405#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {8405#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {8405#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {8405#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {8405#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {8405#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {8405#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {8405#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {8405#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {8405#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {8405#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 58: Hoare triple {8405#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 59: Hoare triple {8405#false} assume 8641 == #t~mem76;havoc #t~mem76; {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {8405#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {8405#false} assume !(9 == ~blastFlag~0); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {8405#false} assume !(12 == ~blastFlag~0); {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {8405#false} assume !false; {8405#false} is VALID [2022-04-08 08:45:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:39,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:39,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388350258] [2022-04-08 08:45:39,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388350258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:39,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:39,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:39,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198907766] [2022-04-08 08:45:39,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198907766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:39,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:39,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:39,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507001778] [2022-04-08 08:45:39,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:39,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:39,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:39,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:39,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:39,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:39,489 INFO L87 Difference]: Start difference. First operand 198 states and 314 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:41,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:46,845 INFO L93 Difference]: Finished difference Result 386 states and 613 transitions. [2022-04-08 08:45:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 08:45:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2022-04-08 08:45:46,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 467 transitions. [2022-04-08 08:45:47,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:47,157 INFO L225 Difference]: With dead ends: 386 [2022-04-08 08:45:47,157 INFO L226 Difference]: Without dead ends: 214 [2022-04-08 08:45:47,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:47,158 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:47,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 513 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:45:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-08 08:45:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2022-04-08 08:45:47,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:47,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.6010362694300517) internal successors, (309), 193 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 08:45:47,165 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.6010362694300517) internal successors, (309), 193 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 08:45:47,165 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 198 states, 193 states have (on average 1.6010362694300517) internal successors, (309), 193 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 08:45:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:47,168 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2022-04-08 08:45:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 333 transitions. [2022-04-08 08:45:47,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:47,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:47,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.6010362694300517) internal successors, (309), 193 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 214 states. [2022-04-08 08:45:47,169 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.6010362694300517) internal successors, (309), 193 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 214 states. [2022-04-08 08:45:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:47,173 INFO L93 Difference]: Finished difference Result 214 states and 333 transitions. [2022-04-08 08:45:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 333 transitions. [2022-04-08 08:45:47,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:47,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:47,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:47,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.6010362694300517) internal successors, (309), 193 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 08:45:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 313 transitions. [2022-04-08 08:45:47,176 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 313 transitions. Word has length 64 [2022-04-08 08:45:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:47,176 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 313 transitions. [2022-04-08 08:45:47,177 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:47,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 313 transitions. [2022-04-08 08:45:47,379 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 08:45:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 313 transitions. [2022-04-08 08:45:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:47,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:47,380 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:47,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-08 08:45:47,380 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:47,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1254604159, now seen corresponding path program 1 times [2022-04-08 08:45:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:47,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144189004] [2022-04-08 08:45:47,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:47,418 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:47,418 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1254604159, now seen corresponding path program 2 times [2022-04-08 08:45:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66688898] [2022-04-08 08:45:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:47,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {10019#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {10012#true} is VALID [2022-04-08 08:45:47,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {10012#true} assume true; {10012#true} is VALID [2022-04-08 08:45:47,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10012#true} {10012#true} #720#return; {10012#true} is VALID [2022-04-08 08:45:47,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {10012#true} call ULTIMATE.init(); {10019#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:47,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {10019#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {10012#true} is VALID [2022-04-08 08:45:47,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {10012#true} assume true; {10012#true} is VALID [2022-04-08 08:45:47,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10012#true} {10012#true} #720#return; {10012#true} is VALID [2022-04-08 08:45:47,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {10012#true} call #t~ret161 := main(); {10012#true} is VALID [2022-04-08 08:45:47,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {10012#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10012#true} is VALID [2022-04-08 08:45:47,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {10012#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {10012#true} is VALID [2022-04-08 08:45:47,526 INFO L272 TraceCheckUtils]: 7: Hoare triple {10012#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10012#true} is VALID [2022-04-08 08:45:47,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {10012#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:47,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {10017#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10018#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {10018#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {10013#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {10013#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {10013#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {10013#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {10013#false} ~skip~0 := 0; {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {10013#false} assume !false; {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {10013#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {10013#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {10013#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {10013#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {10013#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {10013#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {10013#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {10013#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {10013#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {10013#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {10013#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {10013#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {10013#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {10013#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {10013#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {10013#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {10013#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {10013#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {10013#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {10013#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {10013#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {10013#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {10013#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {10013#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {10013#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {10013#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 55: Hoare triple {10013#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {10013#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {10013#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 58: Hoare triple {10013#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 59: Hoare triple {10013#false} assume 8641 == #t~mem76;havoc #t~mem76; {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 60: Hoare triple {10013#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {10013#false} assume !(9 == ~blastFlag~0); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {10013#false} assume !(12 == ~blastFlag~0); {10013#false} is VALID [2022-04-08 08:45:47,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {10013#false} assume !false; {10013#false} is VALID [2022-04-08 08:45:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:47,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66688898] [2022-04-08 08:45:47,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66688898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:47,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:47,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:47,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:47,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144189004] [2022-04-08 08:45:47,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144189004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:47,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:47,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:47,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766257950] [2022-04-08 08:45:47,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:47,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:47,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:47,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:47,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:47,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:47,605 INFO L87 Difference]: Start difference. First operand 198 states and 313 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:51,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:53,017 INFO L93 Difference]: Finished difference Result 384 states and 610 transitions. [2022-04-08 08:45:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 08:45:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 08:45:53,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-08 08:45:53,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:53,316 INFO L225 Difference]: With dead ends: 384 [2022-04-08 08:45:53,317 INFO L226 Difference]: Without dead ends: 212 [2022-04-08 08:45:53,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:53,318 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 20 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:53,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 517 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-08 08:45:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-08 08:45:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2022-04-08 08:45:53,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:53,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 193 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,323 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 193 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,323 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 193 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:53,326 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2022-04-08 08:45:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 330 transitions. [2022-04-08 08:45:53,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:53,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:53,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 193 states have internal predecessors, (308), 3 states have call successors, (3), 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 212 states. [2022-04-08 08:45:53,327 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 193 states have internal predecessors, (308), 3 states have call successors, (3), 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 212 states. [2022-04-08 08:45:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:53,331 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2022-04-08 08:45:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 330 transitions. [2022-04-08 08:45:53,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:53,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:53,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:53,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 193 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 312 transitions. [2022-04-08 08:45:53,334 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 312 transitions. Word has length 64 [2022-04-08 08:45:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:53,334 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 312 transitions. [2022-04-08 08:45:53,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 312 transitions. [2022-04-08 08:45:53,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 312 transitions. [2022-04-08 08:45:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:45:53,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:53,550 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:53,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:45:53,551 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1322164160, now seen corresponding path program 1 times [2022-04-08 08:45:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:53,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [477385613] [2022-04-08 08:45:53,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:53,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:53,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1322164160, now seen corresponding path program 2 times [2022-04-08 08:45:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:53,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318725078] [2022-04-08 08:45:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:53,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {11619#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {11612#true} is VALID [2022-04-08 08:45:53,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {11612#true} assume true; {11612#true} is VALID [2022-04-08 08:45:53,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11612#true} {11612#true} #720#return; {11612#true} is VALID [2022-04-08 08:45:53,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {11612#true} call ULTIMATE.init(); {11619#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:53,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {11612#true} is VALID [2022-04-08 08:45:53,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {11612#true} assume true; {11612#true} is VALID [2022-04-08 08:45:53,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11612#true} {11612#true} #720#return; {11612#true} is VALID [2022-04-08 08:45:53,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {11612#true} call #t~ret161 := main(); {11612#true} is VALID [2022-04-08 08:45:53,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {11612#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11612#true} is VALID [2022-04-08 08:45:53,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {11612#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {11612#true} is VALID [2022-04-08 08:45:53,694 INFO L272 TraceCheckUtils]: 7: Hoare triple {11612#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11612#true} is VALID [2022-04-08 08:45:53,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {11612#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {11617#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11618#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {11618#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {11613#false} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {11613#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {11613#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {11613#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11613#false} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {11613#false} ~skip~0 := 0; {11613#false} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {11613#false} assume !false; {11613#false} is VALID [2022-04-08 08:45:53,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {11613#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {11613#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {11613#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {11613#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {11613#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {11613#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {11613#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {11613#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {11613#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {11613#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {11613#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {11613#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {11613#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {11613#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {11613#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {11613#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {11613#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {11613#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {11613#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {11613#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {11613#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {11613#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {11613#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {11613#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {11613#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {11613#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {11613#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {11613#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {11613#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {11613#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {11613#false} assume 8641 == #t~mem76;havoc #t~mem76; {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {11613#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {11613#false} assume !(9 == ~blastFlag~0); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {11613#false} assume !(12 == ~blastFlag~0); {11613#false} is VALID [2022-04-08 08:45:53,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {11613#false} assume !false; {11613#false} is VALID [2022-04-08 08:45:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:53,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:53,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318725078] [2022-04-08 08:45:53,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318725078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:53,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:53,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:53,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:53,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [477385613] [2022-04-08 08:45:53,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [477385613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:53,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:53,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228793664] [2022-04-08 08:45:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:45:53,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:53,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:53,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:53,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:53,749 INFO L87 Difference]: Start difference. First operand 198 states and 312 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:00,781 INFO L93 Difference]: Finished difference Result 492 states and 784 transitions. [2022-04-08 08:46:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:46:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2022-04-08 08:46:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2022-04-08 08:46:00,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 623 transitions. [2022-04-08 08:46:01,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:01,234 INFO L225 Difference]: With dead ends: 492 [2022-04-08 08:46:01,234 INFO L226 Difference]: Without dead ends: 320 [2022-04-08 08:46:01,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:01,235 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 153 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:01,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 374 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 08:46:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-08 08:46:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2022-04-08 08:46:01,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:01,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5924170616113744) internal successors, (336), 211 states have internal predecessors, (336), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,249 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5924170616113744) internal successors, (336), 211 states have internal predecessors, (336), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,251 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5924170616113744) internal successors, (336), 211 states have internal predecessors, (336), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:01,257 INFO L93 Difference]: Finished difference Result 320 states and 502 transitions. [2022-04-08 08:46:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 502 transitions. [2022-04-08 08:46:01,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:01,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:01,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5924170616113744) internal successors, (336), 211 states have internal predecessors, (336), 3 states have call successors, (3), 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 320 states. [2022-04-08 08:46:01,258 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5924170616113744) internal successors, (336), 211 states have internal predecessors, (336), 3 states have call successors, (3), 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 320 states. [2022-04-08 08:46:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:01,263 INFO L93 Difference]: Finished difference Result 320 states and 502 transitions. [2022-04-08 08:46:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 502 transitions. [2022-04-08 08:46:01,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:01,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:01,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:01,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5924170616113744) internal successors, (336), 211 states have internal predecessors, (336), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 340 transitions. [2022-04-08 08:46:01,267 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 340 transitions. Word has length 64 [2022-04-08 08:46:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:01,267 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 340 transitions. [2022-04-08 08:46:01,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:01,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 340 transitions. [2022-04-08 08:46:01,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 340 transitions. [2022-04-08 08:46:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:46:01,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:01,503 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:01,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:46:01,503 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2041705137, now seen corresponding path program 1 times [2022-04-08 08:46:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:01,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246826743] [2022-04-08 08:46:01,642 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:01,643 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash -429879902, now seen corresponding path program 1 times [2022-04-08 08:46:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:01,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829935555] [2022-04-08 08:46:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:01,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:46:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:01,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:46:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2041705137, now seen corresponding path program 2 times [2022-04-08 08:46:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:01,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627914026] [2022-04-08 08:46:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:01,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:02,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {13687#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {13680#true} is VALID [2022-04-08 08:46:02,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {13680#true} assume true; {13680#true} is VALID [2022-04-08 08:46:02,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13680#true} {13680#true} #720#return; {13680#true} is VALID [2022-04-08 08:46:02,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {13680#true} call ULTIMATE.init(); {13687#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:02,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {13687#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {13680#true} is VALID [2022-04-08 08:46:02,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {13680#true} assume true; {13680#true} is VALID [2022-04-08 08:46:02,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13680#true} {13680#true} #720#return; {13680#true} is VALID [2022-04-08 08:46:02,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {13680#true} call #t~ret161 := main(); {13680#true} is VALID [2022-04-08 08:46:02,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {13680#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13680#true} is VALID [2022-04-08 08:46:02,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {13680#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {13680#true} is VALID [2022-04-08 08:46:02,080 INFO L272 TraceCheckUtils]: 7: Hoare triple {13680#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13680#true} is VALID [2022-04-08 08:46:02,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {13680#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {13685#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13686#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {13686#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {13681#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {13681#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {13681#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {13681#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {13681#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {13681#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {13681#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {13681#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {13681#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {13681#false} ~skip~0 := 0; {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {13681#false} assume !false; {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {13681#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {13681#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {13681#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {13681#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {13681#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {13681#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {13681#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {13681#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {13681#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {13681#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {13681#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {13681#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {13681#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {13681#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {13681#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {13681#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {13681#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {13681#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {13681#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {13681#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {13681#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {13681#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {13681#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 53: Hoare triple {13681#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 54: Hoare triple {13681#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 55: Hoare triple {13681#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {13681#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 57: Hoare triple {13681#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {13681#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 59: Hoare triple {13681#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {13681#false} assume 8641 == #t~mem76;havoc #t~mem76; {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {13681#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {13681#false} is VALID [2022-04-08 08:46:02,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {13681#false} assume !(9 == ~blastFlag~0); {13681#false} is VALID [2022-04-08 08:46:02,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {13681#false} assume !(12 == ~blastFlag~0); {13681#false} is VALID [2022-04-08 08:46:02,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {13681#false} assume !false; {13681#false} is VALID [2022-04-08 08:46:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:02,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627914026] [2022-04-08 08:46:02,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627914026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:02,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:02,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:02,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246826743] [2022-04-08 08:46:02,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246826743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:02,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:02,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914138805] [2022-04-08 08:46:02,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:02,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:46:02,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:02,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:02,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:02,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:02,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:02,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:02,142 INFO L87 Difference]: Start difference. First operand 216 states and 340 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:05,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:08,395 INFO L93 Difference]: Finished difference Result 510 states and 810 transitions. [2022-04-08 08:46:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:46:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-08 08:46:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-08 08:46:08,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 622 transitions. [2022-04-08 08:46:08,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:08,815 INFO L225 Difference]: With dead ends: 510 [2022-04-08 08:46:08,815 INFO L226 Difference]: Without dead ends: 320 [2022-04-08 08:46:08,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:08,816 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 157 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:08,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 374 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 08:46:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-08 08:46:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2022-04-08 08:46:08,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:08,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:08,822 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:08,823 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:08,828 INFO L93 Difference]: Finished difference Result 320 states and 499 transitions. [2022-04-08 08:46:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 499 transitions. [2022-04-08 08:46:08,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:08,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:08,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 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 320 states. [2022-04-08 08:46:08,829 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 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 320 states. [2022-04-08 08:46:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:08,835 INFO L93 Difference]: Finished difference Result 320 states and 499 transitions. [2022-04-08 08:46:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 499 transitions. [2022-04-08 08:46:08,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:08,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:08,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:08,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5781990521327014) internal successors, (333), 211 states have internal predecessors, (333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 337 transitions. [2022-04-08 08:46:08,840 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 337 transitions. Word has length 65 [2022-04-08 08:46:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:08,840 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 337 transitions. [2022-04-08 08:46:08,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:08,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 337 transitions. [2022-04-08 08:46:09,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 337 transitions. [2022-04-08 08:46:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:46:09,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:09,078 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:09,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2022-04-08 08:46:09,078 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2142268013, now seen corresponding path program 1 times [2022-04-08 08:46:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:09,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779387156] [2022-04-08 08:46:09,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:09,214 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash -164715166, now seen corresponding path program 1 times [2022-04-08 08:46:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:09,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251320894] [2022-04-08 08:46:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:09,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:46:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:09,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:46:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2142268013, now seen corresponding path program 2 times [2022-04-08 08:46:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:09,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948949997] [2022-04-08 08:46:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:09,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {15791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {15784#true} is VALID [2022-04-08 08:46:09,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {15784#true} assume true; {15784#true} is VALID [2022-04-08 08:46:09,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15784#true} {15784#true} #720#return; {15784#true} is VALID [2022-04-08 08:46:09,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {15784#true} call ULTIMATE.init(); {15791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:09,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {15791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {15784#true} is VALID [2022-04-08 08:46:09,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {15784#true} assume true; {15784#true} is VALID [2022-04-08 08:46:09,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15784#true} {15784#true} #720#return; {15784#true} is VALID [2022-04-08 08:46:09,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {15784#true} call #t~ret161 := main(); {15784#true} is VALID [2022-04-08 08:46:09,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {15784#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {15784#true} is VALID [2022-04-08 08:46:09,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {15784#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {15784#true} is VALID [2022-04-08 08:46:09,581 INFO L272 TraceCheckUtils]: 7: Hoare triple {15784#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15784#true} is VALID [2022-04-08 08:46:09,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {15784#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {15789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15790#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {15790#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {15785#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {15785#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {15785#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {15785#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {15785#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {15785#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {15785#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {15785#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {15785#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {15785#false} ~skip~0 := 0; {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {15785#false} assume !false; {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {15785#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {15785#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {15785#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {15785#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {15785#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {15785#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {15785#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {15785#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {15785#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {15785#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {15785#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {15785#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {15785#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {15785#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {15785#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {15785#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {15785#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {15785#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {15785#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {15785#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {15785#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {15785#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {15785#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {15785#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {15785#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {15785#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {15785#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {15785#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {15785#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {15785#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 61: Hoare triple {15785#false} assume 8641 == #t~mem76;havoc #t~mem76; {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 62: Hoare triple {15785#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 63: Hoare triple {15785#false} assume !(9 == ~blastFlag~0); {15785#false} is VALID [2022-04-08 08:46:09,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {15785#false} assume !(12 == ~blastFlag~0); {15785#false} is VALID [2022-04-08 08:46:09,590 INFO L290 TraceCheckUtils]: 65: Hoare triple {15785#false} assume !false; {15785#false} is VALID [2022-04-08 08:46:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:09,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948949997] [2022-04-08 08:46:09,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948949997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:09,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:09,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:09,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:09,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779387156] [2022-04-08 08:46:09,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779387156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:09,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:09,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494488492] [2022-04-08 08:46:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:09,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:09,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:09,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:09,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:09,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:09,650 INFO L87 Difference]: Start difference. First operand 216 states and 337 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:17,379 INFO L93 Difference]: Finished difference Result 419 states and 660 transitions. [2022-04-08 08:46:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:17,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-08 08:46:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2022-04-08 08:46:17,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 460 transitions. [2022-04-08 08:46:17,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:17,692 INFO L225 Difference]: With dead ends: 419 [2022-04-08 08:46:17,692 INFO L226 Difference]: Without dead ends: 229 [2022-04-08 08:46:17,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:17,693 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 20 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:17,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 519 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:46:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-08 08:46:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2022-04-08 08:46:17,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:17,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 216 states, 211 states have (on average 1.5734597156398105) internal successors, (332), 211 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,700 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 216 states, 211 states have (on average 1.5734597156398105) internal successors, (332), 211 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,700 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 216 states, 211 states have (on average 1.5734597156398105) internal successors, (332), 211 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:17,704 INFO L93 Difference]: Finished difference Result 229 states and 353 transitions. [2022-04-08 08:46:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 353 transitions. [2022-04-08 08:46:17,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:17,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:17,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5734597156398105) internal successors, (332), 211 states have internal predecessors, (332), 3 states have call successors, (3), 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 229 states. [2022-04-08 08:46:17,706 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5734597156398105) internal successors, (332), 211 states have internal predecessors, (332), 3 states have call successors, (3), 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 229 states. [2022-04-08 08:46:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:17,710 INFO L93 Difference]: Finished difference Result 229 states and 353 transitions. [2022-04-08 08:46:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 353 transitions. [2022-04-08 08:46:17,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:17,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:17,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:17,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5734597156398105) internal successors, (332), 211 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 336 transitions. [2022-04-08 08:46:17,715 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 336 transitions. Word has length 66 [2022-04-08 08:46:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:17,716 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 336 transitions. [2022-04-08 08:46:17,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:17,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 336 transitions. [2022-04-08 08:46:17,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 336 transitions. [2022-04-08 08:46:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:46:17,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:17,944 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:17,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2022-04-08 08:46:17,944 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:17,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2065454730, now seen corresponding path program 1 times [2022-04-08 08:46:17,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:17,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048901073] [2022-04-08 08:46:18,102 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:18,103 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 100449570, now seen corresponding path program 1 times [2022-04-08 08:46:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:18,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354858302] [2022-04-08 08:46:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:18,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:46:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:46:18,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:46:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2065454730, now seen corresponding path program 2 times [2022-04-08 08:46:18,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:18,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123304534] [2022-04-08 08:46:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:18,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {17531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {17524#true} is VALID [2022-04-08 08:46:18,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {17524#true} assume true; {17524#true} is VALID [2022-04-08 08:46:18,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17524#true} {17524#true} #720#return; {17524#true} is VALID [2022-04-08 08:46:18,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {17524#true} call ULTIMATE.init(); {17531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:18,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {17531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {17524#true} is VALID [2022-04-08 08:46:18,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {17524#true} assume true; {17524#true} is VALID [2022-04-08 08:46:18,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17524#true} {17524#true} #720#return; {17524#true} is VALID [2022-04-08 08:46:18,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {17524#true} call #t~ret161 := main(); {17524#true} is VALID [2022-04-08 08:46:18,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {17524#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {17524#true} is VALID [2022-04-08 08:46:18,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {17524#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {17524#true} is VALID [2022-04-08 08:46:18,483 INFO L272 TraceCheckUtils]: 7: Hoare triple {17524#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17524#true} is VALID [2022-04-08 08:46:18,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {17524#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {17529#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17530#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {17530#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {17525#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {17525#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {17525#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {17525#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {17525#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {17525#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {17525#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {17525#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {17525#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {17525#false} ~skip~0 := 0; {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {17525#false} assume !false; {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {17525#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {17525#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {17525#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {17525#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {17525#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {17525#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {17525#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {17525#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {17525#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {17525#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {17525#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {17525#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {17525#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {17525#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {17525#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {17525#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {17525#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {17525#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {17525#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {17525#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {17525#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {17525#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {17525#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {17525#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {17525#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {17525#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {17525#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {17525#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {17525#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {17525#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {17525#false} assume 8641 == #t~mem76;havoc #t~mem76; {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {17525#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {17525#false} is VALID [2022-04-08 08:46:18,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {17525#false} assume !(9 == ~blastFlag~0); {17525#false} is VALID [2022-04-08 08:46:18,492 INFO L290 TraceCheckUtils]: 65: Hoare triple {17525#false} assume !(12 == ~blastFlag~0); {17525#false} is VALID [2022-04-08 08:46:18,492 INFO L290 TraceCheckUtils]: 66: Hoare triple {17525#false} assume !false; {17525#false} is VALID [2022-04-08 08:46:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:18,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:18,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123304534] [2022-04-08 08:46:18,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123304534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:18,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:18,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:18,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:18,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048901073] [2022-04-08 08:46:18,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048901073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:18,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:18,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146651453] [2022-04-08 08:46:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:18,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:46:18,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:18,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:18,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:18,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:18,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:18,536 INFO L87 Difference]: Start difference. First operand 216 states and 336 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:24,041 INFO L93 Difference]: Finished difference Result 409 states and 646 transitions. [2022-04-08 08:46:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:46:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-08 08:46:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-08 08:46:24,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-04-08 08:46:24,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:24,300 INFO L225 Difference]: With dead ends: 409 [2022-04-08 08:46:24,300 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 08:46:24,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:24,301 INFO L913 BasicCegarLoop]: 207 mSDtfsCounter, 11 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:24,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 533 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:46:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 08:46:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2022-04-08 08:46:24,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:24,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,306 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,307 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:24,309 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2022-04-08 08:46:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 339 transitions. [2022-04-08 08:46:24,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:24,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:24,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 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 219 states. [2022-04-08 08:46:24,310 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 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 219 states. [2022-04-08 08:46:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:24,313 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2022-04-08 08:46:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 339 transitions. [2022-04-08 08:46:24,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:24,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:24,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:24,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 335 transitions. [2022-04-08 08:46:24,317 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 335 transitions. Word has length 67 [2022-04-08 08:46:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:24,317 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 335 transitions. [2022-04-08 08:46:24,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 335 transitions. [2022-04-08 08:46:24,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 335 transitions. [2022-04-08 08:46:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:46:24,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:24,555 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:24,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2022-04-08 08:46:24,556 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1168942495, now seen corresponding path program 1 times [2022-04-08 08:46:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:24,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91422013] [2022-04-08 08:46:24,576 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:24,577 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:24,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1168942495, now seen corresponding path program 2 times [2022-04-08 08:46:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:24,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992014492] [2022-04-08 08:46:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:24,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:24,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {19231#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {19224#true} is VALID [2022-04-08 08:46:24,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {19224#true} assume true; {19224#true} is VALID [2022-04-08 08:46:24,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19224#true} {19224#true} #720#return; {19224#true} is VALID [2022-04-08 08:46:24,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {19224#true} call ULTIMATE.init(); {19231#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:24,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {19231#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {19224#true} is VALID [2022-04-08 08:46:24,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {19224#true} assume true; {19224#true} is VALID [2022-04-08 08:46:24,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19224#true} {19224#true} #720#return; {19224#true} is VALID [2022-04-08 08:46:24,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {19224#true} call #t~ret161 := main(); {19224#true} is VALID [2022-04-08 08:46:24,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {19224#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {19224#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L272 TraceCheckUtils]: 7: Hoare triple {19224#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {19224#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {19224#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {19224#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {19224#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {19224#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {19224#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {19224#true} assume !false; {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {19224#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {19224#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {19224#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {19224#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {19224#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {19224#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {19224#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {19224#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {19224#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19224#true} is VALID [2022-04-08 08:46:24,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {19224#true} assume 8464 == #t~mem55;havoc #t~mem55; {19224#true} is VALID [2022-04-08 08:46:24,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {19224#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {19224#true} is VALID [2022-04-08 08:46:24,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {19224#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19224#true} is VALID [2022-04-08 08:46:24,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {19224#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {19229#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19230#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {19230#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {19225#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {19225#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 47: Hoare triple {19225#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {19225#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 49: Hoare triple {19225#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {19225#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 51: Hoare triple {19225#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {19225#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {19225#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {19225#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {19225#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {19225#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {19225#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {19225#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {19225#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {19225#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 61: Hoare triple {19225#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 62: Hoare triple {19225#false} assume 8641 == #t~mem76;havoc #t~mem76; {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 63: Hoare triple {19225#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 64: Hoare triple {19225#false} assume !(9 == ~blastFlag~0); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {19225#false} assume !(12 == ~blastFlag~0); {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L290 TraceCheckUtils]: 66: Hoare triple {19225#false} assume !false; {19225#false} is VALID [2022-04-08 08:46:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:24,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992014492] [2022-04-08 08:46:24,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992014492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:24,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:24,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:24,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:24,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91422013] [2022-04-08 08:46:24,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91422013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:24,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:24,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106161796] [2022-04-08 08:46:24,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:24,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:46:24,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:24,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:24,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:24,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:24,729 INFO L87 Difference]: Start difference. First operand 216 states and 335 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:30,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:31,447 INFO L93 Difference]: Finished difference Result 448 states and 704 transitions. [2022-04-08 08:46:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:31,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:46:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-08 08:46:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-08 08:46:31,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 493 transitions. [2022-04-08 08:46:31,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:31,741 INFO L225 Difference]: With dead ends: 448 [2022-04-08 08:46:31,741 INFO L226 Difference]: Without dead ends: 258 [2022-04-08 08:46:31,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:31,741 INFO L913 BasicCegarLoop]: 204 mSDtfsCounter, 32 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:31,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 533 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 08:46:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-08 08:46:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2022-04-08 08:46:31,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:31,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 233 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:31,748 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 233 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:31,748 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 233 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:31,751 INFO L93 Difference]: Finished difference Result 258 states and 397 transitions. [2022-04-08 08:46:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 397 transitions. [2022-04-08 08:46:31,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:31,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:31,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 233 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-08 08:46:31,752 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 233 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-08 08:46:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:31,755 INFO L93 Difference]: Finished difference Result 258 states and 397 transitions. [2022-04-08 08:46:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 397 transitions. [2022-04-08 08:46:31,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:31,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:31,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:31,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 233 states have internal predecessors, (367), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 371 transitions. [2022-04-08 08:46:31,759 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 371 transitions. Word has length 67 [2022-04-08 08:46:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:31,760 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 371 transitions. [2022-04-08 08:46:31,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:31,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 371 transitions. [2022-04-08 08:46:31,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 371 transitions. [2022-04-08 08:46:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 08:46:31,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:31,999 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] [2022-04-08 08:46:31,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:46:31,999 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 495128740, now seen corresponding path program 1 times [2022-04-08 08:46:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:32,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139262694] [2022-04-08 08:46:32,050 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:32,050 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:32,050 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:32,051 INFO L85 PathProgramCache]: Analyzing trace with hash 495128740, now seen corresponding path program 2 times [2022-04-08 08:46:32,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:32,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708501296] [2022-04-08 08:46:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:32,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {21131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {21124#true} is VALID [2022-04-08 08:46:32,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {21124#true} assume true; {21124#true} is VALID [2022-04-08 08:46:32,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21124#true} {21124#true} #720#return; {21124#true} is VALID [2022-04-08 08:46:32,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {21124#true} call ULTIMATE.init(); {21131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:32,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {21131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {21124#true} is VALID [2022-04-08 08:46:32,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {21124#true} assume true; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21124#true} {21124#true} #720#return; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {21124#true} call #t~ret161 := main(); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {21124#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {21124#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L272 TraceCheckUtils]: 7: Hoare triple {21124#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {21124#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {21124#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {21124#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {21124#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {21124#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {21124#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {21124#true} assume !false; {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {21124#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {21124#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {21124#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {21124#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {21124#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {21124#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {21124#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {21124#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {21124#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21124#true} is VALID [2022-04-08 08:46:32,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {21124#true} assume 8464 == #t~mem55;havoc #t~mem55; {21124#true} is VALID [2022-04-08 08:46:32,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {21124#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21124#true} is VALID [2022-04-08 08:46:32,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {21124#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21124#true} is VALID [2022-04-08 08:46:32,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {21124#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:32,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {21129#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21130#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-08 08:46:32,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {21130#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {21125#false} is VALID [2022-04-08 08:46:32,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {21125#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {21125#false} is VALID [2022-04-08 08:46:32,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {21125#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {21125#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {21125#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21125#false} is VALID [2022-04-08 08:46:32,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {21125#false} ~skip~0 := 0; {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {21125#false} assume !false; {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {21125#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {21125#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {21125#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 48: Hoare triple {21125#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {21125#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {21125#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {21125#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {21125#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {21125#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {21125#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 55: Hoare triple {21125#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {21125#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {21125#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {21125#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {21125#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {21125#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {21125#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 62: Hoare triple {21125#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {21125#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {21125#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {21125#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {21125#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {21125#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {21125#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {21125#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 70: Hoare triple {21125#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {21125#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {21125#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {21125#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {21125#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 75: Hoare triple {21125#false} assume 8641 == #t~mem76;havoc #t~mem76; {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {21125#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {21125#false} assume !(9 == ~blastFlag~0); {21125#false} is VALID [2022-04-08 08:46:32,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {21125#false} assume !(12 == ~blastFlag~0); {21125#false} is VALID [2022-04-08 08:46:32,174 INFO L290 TraceCheckUtils]: 79: Hoare triple {21125#false} assume !false; {21125#false} is VALID [2022-04-08 08:46:32,174 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 08:46:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708501296] [2022-04-08 08:46:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708501296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:32,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:32,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:32,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:32,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139262694] [2022-04-08 08:46:32,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139262694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:32,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:32,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455735344] [2022-04-08 08:46:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:32,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 80 [2022-04-08 08:46:32,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:32,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:32,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:32,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:32,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:32,229 INFO L87 Difference]: Start difference. First operand 238 states and 371 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:37,421 INFO L93 Difference]: Finished difference Result 470 states and 739 transitions. [2022-04-08 08:46:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:37,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 80 [2022-04-08 08:46:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2022-04-08 08:46:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2022-04-08 08:46:37,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 492 transitions. [2022-04-08 08:46:37,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:37,709 INFO L225 Difference]: With dead ends: 470 [2022-04-08 08:46:37,709 INFO L226 Difference]: Without dead ends: 258 [2022-04-08 08:46:37,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:37,710 INFO L913 BasicCegarLoop]: 205 mSDtfsCounter, 37 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:37,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 533 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 08:46:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-08 08:46:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2022-04-08 08:46:37,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:37,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5708154506437768) internal successors, (366), 233 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,716 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5708154506437768) internal successors, (366), 233 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,717 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 238 states, 233 states have (on average 1.5708154506437768) internal successors, (366), 233 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:37,720 INFO L93 Difference]: Finished difference Result 258 states and 396 transitions. [2022-04-08 08:46:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2022-04-08 08:46:37,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:37,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:37,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.5708154506437768) internal successors, (366), 233 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-08 08:46:37,721 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.5708154506437768) internal successors, (366), 233 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 258 states. [2022-04-08 08:46:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:37,724 INFO L93 Difference]: Finished difference Result 258 states and 396 transitions. [2022-04-08 08:46:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2022-04-08 08:46:37,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:37,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:37,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:37,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.5708154506437768) internal successors, (366), 233 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 370 transitions. [2022-04-08 08:46:37,728 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 370 transitions. Word has length 80 [2022-04-08 08:46:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:37,728 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 370 transitions. [2022-04-08 08:46:37,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:37,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 370 transitions. [2022-04-08 08:46:37,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 370 transitions. [2022-04-08 08:46:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 08:46:37,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:37,980 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] [2022-04-08 08:46:37,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:46:37,980 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:37,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2068312280, now seen corresponding path program 1 times [2022-04-08 08:46:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:37,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [379118593] [2022-04-08 08:46:38,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:38,010 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:38,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2068312280, now seen corresponding path program 2 times [2022-04-08 08:46:38,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:38,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789336258] [2022-04-08 08:46:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:38,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {23075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {23068#true} is VALID [2022-04-08 08:46:38,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {23068#true} assume true; {23068#true} is VALID [2022-04-08 08:46:38,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23068#true} {23068#true} #720#return; {23068#true} is VALID [2022-04-08 08:46:38,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {23068#true} call ULTIMATE.init(); {23075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:38,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {23075#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {23068#true} assume true; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23068#true} {23068#true} #720#return; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {23068#true} call #t~ret161 := main(); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {23068#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {23068#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L272 TraceCheckUtils]: 7: Hoare triple {23068#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {23068#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {23068#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {23068#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {23068#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {23068#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {23068#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {23068#true} assume !false; {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {23068#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {23068#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {23068#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {23068#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {23068#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {23068#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {23068#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {23068#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {23068#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {23068#true} assume 8464 == #t~mem55;havoc #t~mem55; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {23068#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {23068#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {23068#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {23068#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {23068#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {23068#true} ~skip~0 := 0; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {23068#true} assume !false; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {23068#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {23068#true} assume 12292 == #t~mem47;havoc #t~mem47; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {23068#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {23068#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {23068#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {23068#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {23068#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {23068#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {23068#true} is VALID [2022-04-08 08:46:38,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {23068#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {23068#true} is VALID [2022-04-08 08:46:38,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {23068#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:38,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {23073#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23074#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {23074#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {23069#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {23069#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {23069#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {23069#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {23069#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {23069#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {23069#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {23069#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {23069#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {23069#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {23069#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {23069#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 65: Hoare triple {23069#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 66: Hoare triple {23069#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {23069#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,130 INFO L290 TraceCheckUtils]: 68: Hoare triple {23069#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 69: Hoare triple {23069#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {23069#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {23069#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {23069#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {23069#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 74: Hoare triple {23069#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 75: Hoare triple {23069#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 76: Hoare triple {23069#false} assume 8641 == #t~mem76;havoc #t~mem76; {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {23069#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 78: Hoare triple {23069#false} assume !(9 == ~blastFlag~0); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 79: Hoare triple {23069#false} assume !(12 == ~blastFlag~0); {23069#false} is VALID [2022-04-08 08:46:38,131 INFO L290 TraceCheckUtils]: 80: Hoare triple {23069#false} assume !false; {23069#false} is VALID [2022-04-08 08:46:38,131 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 08:46:38,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:38,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789336258] [2022-04-08 08:46:38,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789336258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:38,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:38,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:38,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:38,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [379118593] [2022-04-08 08:46:38,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [379118593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:38,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:38,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:38,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635060986] [2022-04-08 08:46:38,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:38,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 81 [2022-04-08 08:46:38,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:38,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:38,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:38,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:38,189 INFO L87 Difference]: Start difference. First operand 238 states and 370 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:43,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:44,679 INFO L93 Difference]: Finished difference Result 479 states and 753 transitions. [2022-04-08 08:46:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:44,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 81 [2022-04-08 08:46:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 08:46:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 08:46:44,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-08 08:46:44,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:44,974 INFO L225 Difference]: With dead ends: 479 [2022-04-08 08:46:44,974 INFO L226 Difference]: Without dead ends: 267 [2022-04-08 08:46:44,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:44,975 INFO L913 BasicCegarLoop]: 240 mSDtfsCounter, 21 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:44,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 604 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 408 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 08:46:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-08 08:46:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 254. [2022-04-08 08:46:44,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:44,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 254 states, 249 states have (on average 1.570281124497992) internal successors, (391), 249 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:44,983 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 254 states, 249 states have (on average 1.570281124497992) internal successors, (391), 249 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:44,984 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 254 states, 249 states have (on average 1.570281124497992) internal successors, (391), 249 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:44,987 INFO L93 Difference]: Finished difference Result 267 states and 411 transitions. [2022-04-08 08:46:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2022-04-08 08:46:44,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:44,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:44,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 249 states have (on average 1.570281124497992) internal successors, (391), 249 states have internal predecessors, (391), 3 states have call successors, (3), 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 267 states. [2022-04-08 08:46:44,988 INFO L87 Difference]: Start difference. First operand has 254 states, 249 states have (on average 1.570281124497992) internal successors, (391), 249 states have internal predecessors, (391), 3 states have call successors, (3), 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 267 states. [2022-04-08 08:46:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:44,992 INFO L93 Difference]: Finished difference Result 267 states and 411 transitions. [2022-04-08 08:46:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2022-04-08 08:46:44,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:44,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:44,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:44,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.570281124497992) internal successors, (391), 249 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 395 transitions. [2022-04-08 08:46:44,997 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 395 transitions. Word has length 81 [2022-04-08 08:46:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:44,997 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 395 transitions. [2022-04-08 08:46:44,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:44,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 395 transitions. [2022-04-08 08:46:45,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 395 transitions. [2022-04-08 08:46:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 08:46:45,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:45,250 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] [2022-04-08 08:46:45,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:46:45,250 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash 775255267, now seen corresponding path program 1 times [2022-04-08 08:46:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:45,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [484893399] [2022-04-08 08:46:45,292 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:45,292 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:45,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash 775255267, now seen corresponding path program 2 times [2022-04-08 08:46:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:45,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963532238] [2022-04-08 08:46:45,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:45,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:45,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {25087#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {25080#true} is VALID [2022-04-08 08:46:45,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {25080#true} assume true; {25080#true} is VALID [2022-04-08 08:46:45,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25080#true} {25080#true} #720#return; {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {25080#true} call ULTIMATE.init(); {25087#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:45,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {25087#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_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); {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {25080#true} assume true; {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25080#true} {25080#true} #720#return; {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {25080#true} call #t~ret161 := main(); {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {25080#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {25080#true} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L272 TraceCheckUtils]: 7: Hoare triple {25080#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {25080#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {25080#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25080#true} is VALID [2022-04-08 08:46:45,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {25080#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {25080#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {25080#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {25080#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {25080#true} assume !false; {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {25080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {25080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {25080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {25080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {25080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {25080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {25080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {25080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {25080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {25080#true} assume 8464 == #t~mem55;havoc #t~mem55; {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {25080#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25080#true} is VALID [2022-04-08 08:46:45,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {25080#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25080#true} is VALID [2022-04-08 08:46:45,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {25080#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {25085#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25086#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {25086#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {25081#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {25081#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {25081#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {25081#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {25081#false} ~skip~0 := 0; {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {25081#false} assume !false; {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {25081#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {25081#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {25081#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {25081#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {25081#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {25081#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {25081#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {25081#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {25081#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {25081#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {25081#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {25081#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {25081#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 59: Hoare triple {25081#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {25081#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {25081#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {25081#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {25081#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {25081#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {25081#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {25081#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {25081#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {25081#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {25081#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 70: Hoare triple {25081#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,394 INFO L290 TraceCheckUtils]: 71: Hoare triple {25081#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 72: Hoare triple {25081#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {25081#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 74: Hoare triple {25081#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 75: Hoare triple {25081#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 76: Hoare triple {25081#false} assume 8641 == #t~mem76;havoc #t~mem76; {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {25081#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 78: Hoare triple {25081#false} assume !(9 == ~blastFlag~0); {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {25081#false} assume !(12 == ~blastFlag~0); {25081#false} is VALID [2022-04-08 08:46:45,395 INFO L290 TraceCheckUtils]: 80: Hoare triple {25081#false} assume !false; {25081#false} is VALID [2022-04-08 08:46:45,395 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 08:46:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:45,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963532238] [2022-04-08 08:46:45,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963532238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:45,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:45,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:45,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:45,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [484893399] [2022-04-08 08:46:45,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [484893399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:45,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:45,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831696769] [2022-04-08 08:46:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:45,396 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 81 [2022-04-08 08:46:45,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:45,397 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 08:46:45,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:45,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:45,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:45,455 INFO L87 Difference]: Start difference. First operand 254 states and 395 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 08:46:50,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:52,065 INFO L93 Difference]: Finished difference Result 586 states and 923 transitions. [2022-04-08 08:46:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:52,066 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 81 [2022-04-08 08:46:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:52,066 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 08:46:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-08 08:46:52,068 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 08:46:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-08 08:46:52,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 621 transitions. [2022-04-08 08:46:52,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:52,448 INFO L225 Difference]: With dead ends: 586 [2022-04-08 08:46:52,448 INFO L226 Difference]: Without dead ends: 358 [2022-04-08 08:46:52,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:52,451 INFO L913 BasicCegarLoop]: 128 mSDtfsCounter, 153 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:52,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 374 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 08:46:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-08 08:46:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 254. [2022-04-08 08:46:52,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:52,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 254 states, 249 states have (on average 1.5582329317269077) internal successors, (388), 249 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:52,458 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 254 states, 249 states have (on average 1.5582329317269077) internal successors, (388), 249 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:52,459 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 254 states, 249 states have (on average 1.5582329317269077) internal successors, (388), 249 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:52,463 INFO L93 Difference]: Finished difference Result 358 states and 554 transitions. [2022-04-08 08:46:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 554 transitions. [2022-04-08 08:46:52,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:52,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:52,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 249 states have (on average 1.5582329317269077) internal successors, (388), 249 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 358 states. [2022-04-08 08:46:52,464 INFO L87 Difference]: Start difference. First operand has 254 states, 249 states have (on average 1.5582329317269077) internal successors, (388), 249 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 358 states. [2022-04-08 08:46:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:52,469 INFO L93 Difference]: Finished difference Result 358 states and 554 transitions. [2022-04-08 08:46:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 554 transitions. [2022-04-08 08:46:52,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:52,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:52,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:52,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.5582329317269077) internal successors, (388), 249 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 392 transitions. [2022-04-08 08:46:52,474 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 392 transitions. Word has length 81 [2022-04-08 08:46:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:52,474 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 392 transitions. [2022-04-08 08:46:52,474 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 08:46:52,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 392 transitions. [2022-04-08 08:46:52,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2022-04-08 08:46:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:46:52,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:52,729 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] [2022-04-08 08:46:52,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:46:52,729 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -905587147, now seen corresponding path program 1 times [2022-04-08 08:46:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:52,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823889205] [2022-04-08 08:46:52,858 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 17 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:52,859 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:52,859 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:52,859 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:46:52,862 INFO L158 Benchmark]: Toolchain (without parser) took 109437.67ms. Allocated memory was 187.7MB in the beginning and 305.1MB in the end (delta: 117.4MB). Free memory was 135.8MB in the beginning and 234.0MB in the end (delta: -98.1MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2022-04-08 08:46:52,862 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:46:52,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.42ms. Allocated memory is still 187.7MB. Free memory was 135.6MB in the beginning and 139.1MB in the end (delta: -3.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-08 08:46:52,863 INFO L158 Benchmark]: Boogie Preprocessor took 124.42ms. Allocated memory is still 187.7MB. Free memory was 139.1MB in the beginning and 129.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:46:52,863 INFO L158 Benchmark]: RCFGBuilder took 1504.50ms. Allocated memory was 187.7MB in the beginning and 235.9MB in the end (delta: 48.2MB). Free memory was 129.0MB in the beginning and 136.7MB in the end (delta: -7.6MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. [2022-04-08 08:46:52,863 INFO L158 Benchmark]: TraceAbstraction took 107313.75ms. Allocated memory was 235.9MB in the beginning and 305.1MB in the end (delta: 69.2MB). Free memory was 136.2MB in the beginning and 234.0MB in the end (delta: -97.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:46:52,864 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.14ms. Allocated memory is still 187.7MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.42ms. Allocated memory is still 187.7MB. Free memory was 135.6MB in the beginning and 139.1MB in the end (delta: -3.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 124.42ms. Allocated memory is still 187.7MB. Free memory was 139.1MB in the beginning and 129.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1504.50ms. Allocated memory was 187.7MB in the beginning and 235.9MB in the end (delta: 48.2MB). Free memory was 129.0MB in the beginning and 136.7MB in the end (delta: -7.6MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. * TraceAbstraction took 107313.75ms. Allocated memory was 235.9MB in the beginning and 305.1MB in the end (delta: 69.2MB). Free memory was 136.2MB in the beginning and 234.0MB in the end (delta: -97.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:46:52,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...