/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.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:37:56,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:37:56,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:37:56,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:37:56,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:37:56,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:37:56,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:37:56,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:37:56,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:37:56,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:37:56,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:37:56,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:37:56,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:37:56,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:37:56,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:37:56,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:37:56,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:37:56,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:37:56,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:37:56,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:37:56,574 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:37:56,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:37:56,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:37:56,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:37:56,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:37:56,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:37:56,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:37:56,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:37:56,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:37:56,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:37:56,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:37:56,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:37:56,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:37:56,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:37:56,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:37:56,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:37:56,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:37:56,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:37:56,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:37:56,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:37:56,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:37:56,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:37:56,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:37:56,595 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:37:56,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:37:56,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:37:56,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:37:56,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:37:56,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:37:56,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:37:56,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:37:56,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:37:56,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:37:56,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:37:56,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:37:56,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:37:56,599 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:37:56,599 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:37:56,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:37:56,599 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:37:56,599 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:37:56,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:37:56,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:37:56,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:37:56,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:37:56,766 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:37:56,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-15 11:37:56,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153c85e2e/33105978e44f4aa586746cf916abfff3/FLAG50b19b2b8 [2022-04-15 11:37:57,264 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:37:57,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-15 11:37:57,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153c85e2e/33105978e44f4aa586746cf916abfff3/FLAG50b19b2b8 [2022-04-15 11:37:57,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153c85e2e/33105978e44f4aa586746cf916abfff3 [2022-04-15 11:37:57,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:37:57,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:37:57,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:37:57,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:37:57,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:37:57,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d9a6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57, skipping insertion in model container [2022-04-15 11:37:57,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:37:57,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:37:57,642 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.02.i.cil-1.c[72502,72515] [2022-04-15 11:37:57,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:37:57,661 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:37:57,733 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.02.i.cil-1.c[72502,72515] [2022-04-15 11:37:57,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:37:57,752 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:37:57,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57 WrapperNode [2022-04-15 11:37:57,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:37:57,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:37:57,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:37:57,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:37:57,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:37:57,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:37:57,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:37:57,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:37:57,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (1/1) ... [2022-04-15 11:37:57,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:37:57,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:37:57,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:37:57,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:37:57,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:37:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:37:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:37:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:37:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:37:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:37:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:37:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:37:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:37:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:37:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:37:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:37:58,095 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:37:58,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:38:00,427 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:38:00,847 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:38:00,847 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:38:00,858 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:38:00,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:38:00,867 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:38:00,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:38:00 BoogieIcfgContainer [2022-04-15 11:38:00,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:38:00,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:38:00,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:38:00,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:38:00,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:37:57" (1/3) ... [2022-04-15 11:38:00,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe0d3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:38:00, skipping insertion in model container [2022-04-15 11:38:00,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:37:57" (2/3) ... [2022-04-15 11:38:00,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe0d3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:38:00, skipping insertion in model container [2022-04-15 11:38:00,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:38:00" (3/3) ... [2022-04-15 11:38:00,875 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2022-04-15 11:38:00,880 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:38:00,880 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:38:00,906 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:38:00,910 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:38:00,910 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:38:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:38:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 11:38:00,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:00,940 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:00,940 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 1 times [2022-04-15 11:38:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:00,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [654917406] [2022-04-15 11:38:00,958 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:38:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 2 times [2022-04-15 11:38:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:00,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782590344] [2022-04-15 11:38:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:01,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-15 11:38:01,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 11:38:01,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-15 11:38:01,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {163#(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-15 11:38:01,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-15 11:38:01,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 11:38:01,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-15 11:38:01,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-15 11:38:01,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {156#true} is VALID [2022-04-15 11:38:01,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {156#true} is VALID [2022-04-15 11:38:01,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {156#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {156#true} is VALID [2022-04-15 11:38:01,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {156#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;~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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#(= 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)))); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:01,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {161#(= 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); {162#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:38:01,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {162#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {157#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {157#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {157#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {157#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {157#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {157#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {157#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {157#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {157#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {157#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {157#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {157#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {157#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {157#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {157#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {157#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {157#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {157#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {157#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {157#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {157#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {157#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-15 11:38:01,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-15 11:38:01,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {157#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157#false} is VALID [2022-04-15 11:38:01,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 3 == ~blastFlag~0; {157#false} is VALID [2022-04-15 11:38:01,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 11:38:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:38:01,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:01,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782590344] [2022-04-15 11:38:01,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782590344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:01,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:01,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:01,474 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:01,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [654917406] [2022-04-15 11:38:01,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [654917406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:01,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:01,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15174446] [2022-04-15 11:38:01,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:01,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 11:38:01,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:01,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:01,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:01,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:01,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:01,555 INFO L87 Difference]: Start difference. First operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:03,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:04,918 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-15 11:38:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:04,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 11:38:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-15 11:38:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-15 11:38:04,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-15 11:38:05,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:05,368 INFO L225 Difference]: With dead ends: 324 [2022-04-15 11:38:05,368 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 11:38:05,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:05,375 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 34 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:05,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 577 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 11:38:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-15 11:38:05,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:05,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:05,416 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:05,416 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:05,425 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-15 11:38:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-15 11:38:05,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:05,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:05,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 11:38:05,456 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 11:38:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:05,462 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-15 11:38:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-15 11:38:05,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:05,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:05,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:05,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-15 11:38:05,468 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-15 11:38:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:05,468 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-15 11:38:05,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:05,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 224 transitions. [2022-04-15 11:38:05,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-15 11:38:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:38:05,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:05,618 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:05,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:38:05,620 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 1 times [2022-04-15 11:38:05,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:05,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1738975868] [2022-04-15 11:38:05,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:38:05,649 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:38:05,649 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 2 times [2022-04-15 11:38:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:05,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247967628] [2022-04-15 11:38:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:05,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1442#true} is VALID [2022-04-15 11:38:05,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-15 11:38:05,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-15 11:38:05,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1449#(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-15 11:38:05,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1449#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1442#true} is VALID [2022-04-15 11:38:05,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-15 11:38:05,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-15 11:38:05,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret161 := main(); {1442#true} is VALID [2022-04-15 11:38:05,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {1442#true} is VALID [2022-04-15 11:38:05,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1442#true} is VALID [2022-04-15 11:38:05,845 INFO L272 TraceCheckUtils]: 7: Hoare triple {1442#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1442#true} is VALID [2022-04-15 11:38:05,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {1442#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;~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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {1447#(= 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; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {1447#(= 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; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {1447#(= 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)))); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {1447#(= 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; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {1447#(= 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); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:05,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {1447#(= 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); {1448#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-15 11:38:05,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {1448#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {1443#false} is VALID [2022-04-15 11:38:05,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {1443#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; {1443#false} is VALID [2022-04-15 11:38:05,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {1443#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); {1443#false} is VALID [2022-04-15 11:38:05,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {1443#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); {1443#false} is VALID [2022-04-15 11:38:05,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {1443#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1443#false} is VALID [2022-04-15 11:38:05,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {1443#false} ~skip~0 := 0; {1443#false} is VALID [2022-04-15 11:38:05,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-15 11:38:05,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {1443#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); {1443#false} is VALID [2022-04-15 11:38:05,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {1443#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {1443#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {1443#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {1443#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {1443#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {1443#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {1443#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {1443#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {1443#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {1443#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {1443#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {1443#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {1443#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {1443#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {1443#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {1443#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {1443#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {1443#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {1443#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {1443#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {1443#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {1443#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {1443#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {1443#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {1443#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {1443#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {1443#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,864 INFO L290 TraceCheckUtils]: 56: Hoare triple {1443#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {1443#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {1443#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {1443#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {1443#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {1443#false} is VALID [2022-04-15 11:38:05,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {1443#false} assume 8672 == #t~mem79;havoc #t~mem79; {1443#false} is VALID [2022-04-15 11:38:05,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {1443#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {1443#false} is VALID [2022-04-15 11:38:05,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {1443#false} assume 3 == ~blastFlag~0; {1443#false} is VALID [2022-04-15 11:38:05,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-15 11:38:05,866 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-15 11:38:05,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:05,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247967628] [2022-04-15 11:38:05,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247967628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:05,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:05,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:05,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:05,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1738975868] [2022-04-15 11:38:05,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1738975868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:05,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:05,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:05,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046804858] [2022-04-15 11:38:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:05,868 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-15 11:38:05,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:05,869 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-15 11:38:05,917 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-15 11:38:05,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:05,918 INFO L87 Difference]: Start difference. First operand 148 states and 224 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-15 11:38:09,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:11,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:13,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:14,181 INFO L93 Difference]: Finished difference Result 287 states and 431 transitions. [2022-04-15 11:38:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:14,181 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-15 11:38:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:14,181 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-15 11:38:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-15 11:38:14,186 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-15 11:38:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-15 11:38:14,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 431 transitions. [2022-04-15 11:38:14,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:14,470 INFO L225 Difference]: With dead ends: 287 [2022-04-15 11:38:14,470 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 11:38:14,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:14,472 INFO L913 BasicCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:14,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 3 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 11:38:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 11:38:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-15 11:38:14,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:14,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,479 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,479 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:14,483 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-15 11:38:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-15 11:38:14,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:14,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:14,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 11:38:14,484 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 11:38:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:14,489 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-15 11:38:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-15 11:38:14,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:14,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:14,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:14,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5314685314685315) internal successors, (219), 143 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2022-04-15 11:38:14,497 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 65 [2022-04-15 11:38:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:14,499 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2022-04-15 11:38:14,499 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-15 11:38:14,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 223 transitions. [2022-04-15 11:38:14,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-15 11:38:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:38:14,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:14,636 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:14,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:38:14,637 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 1 times [2022-04-15 11:38:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:14,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [522493034] [2022-04-15 11:38:14,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:38:14,673 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:38:14,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 2 times [2022-04-15 11:38:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:14,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642123932] [2022-04-15 11:38:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:14,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:14,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2654#true} is VALID [2022-04-15 11:38:14,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-15 11:38:14,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-15 11:38:14,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {2654#true} call ULTIMATE.init(); {2661#(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-15 11:38:14,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {2661#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2654#true} is VALID [2022-04-15 11:38:14,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-15 11:38:14,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-15 11:38:14,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {2654#true} call #t~ret161 := main(); {2654#true} is VALID [2022-04-15 11:38:14,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {2654#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {2654#true} is VALID [2022-04-15 11:38:14,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {2654#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2654#true} is VALID [2022-04-15 11:38:14,784 INFO L272 TraceCheckUtils]: 7: Hoare triple {2654#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2654#true} is VALID [2022-04-15 11:38:14,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {2654#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;~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); {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:38:14,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(not (= 12292 (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; {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:38:14,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {2659#(not (= 12292 (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; {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:38:14,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {2659#(not (= 12292 (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)))); {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:38:14,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {2659#(not (= 12292 (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); {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:38:14,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {2659#(not (= 12292 (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; {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:38:14,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:38:14,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {2659#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2660#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 11:38:14,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {2660#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {2655#false} is VALID [2022-04-15 11:38:14,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {2655#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {2655#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {2655#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2655#false} is VALID [2022-04-15 11:38:14,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {2655#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {2655#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); {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {2655#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {2655#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); {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {2655#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); {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {2655#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); {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {2655#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {2655#false} ~skip~0 := 0; {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-15 11:38:14,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {2655#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); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {2655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {2655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {2655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {2655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {2655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {2655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {2655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {2655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {2655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {2655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {2655#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {2655#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {2655#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {2655#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {2655#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {2655#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {2655#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {2655#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {2655#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {2655#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {2655#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {2655#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {2655#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {2655#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {2655#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {2655#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {2655#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {2655#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {2655#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {2655#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {2655#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {2655#false} assume 8672 == #t~mem79;havoc #t~mem79; {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {2655#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {2655#false} assume 3 == ~blastFlag~0; {2655#false} is VALID [2022-04-15 11:38:14,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-15 11:38:14,795 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-15 11:38:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:14,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642123932] [2022-04-15 11:38:14,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642123932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:14,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:14,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:14,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:14,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [522493034] [2022-04-15 11:38:14,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [522493034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:14,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:14,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794677742] [2022-04-15 11:38:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:14,796 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-15 11:38:14,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:14,797 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-15 11:38:14,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:14,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:14,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:14,843 INFO L87 Difference]: Start difference. First operand 148 states and 223 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-15 11:38:16,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:17,989 INFO L93 Difference]: Finished difference Result 383 states and 584 transitions. [2022-04-15 11:38:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:17,989 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-15 11:38:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:17,989 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-15 11:38:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-15 11:38:17,994 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-15 11:38:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-15 11:38:17,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-15 11:38:18,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:18,373 INFO L225 Difference]: With dead ends: 383 [2022-04-15 11:38:18,374 INFO L226 Difference]: Without dead ends: 261 [2022-04-15 11:38:18,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:18,375 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:18,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 314 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 461 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 11:38:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-15 11:38:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 159. [2022-04-15 11:38:18,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:18,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 159 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 154 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:18,383 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 159 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 154 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:18,383 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 159 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 154 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:18,394 INFO L93 Difference]: Finished difference Result 261 states and 396 transitions. [2022-04-15 11:38:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 396 transitions. [2022-04-15 11:38:18,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:18,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:18,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 154 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-15 11:38:18,395 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 154 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-15 11:38:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:18,406 INFO L93 Difference]: Finished difference Result 261 states and 396 transitions. [2022-04-15 11:38:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 396 transitions. [2022-04-15 11:38:18,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:18,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:18,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:18,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 154 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 238 transitions. [2022-04-15 11:38:18,412 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 238 transitions. Word has length 66 [2022-04-15 11:38:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:18,412 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 238 transitions. [2022-04-15 11:38:18,413 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-15 11:38:18,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 238 transitions. [2022-04-15 11:38:18,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 238 transitions. [2022-04-15 11:38:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:38:18,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:18,576 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:18,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:38:18,576 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 1 times [2022-04-15 11:38:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:18,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113270069] [2022-04-15 11:38:18,719 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-15 11:38:18,720 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1251261439, now seen corresponding path program 1 times [2022-04-15 11:38:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:18,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494176237] [2022-04-15 11:38:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:18,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:18,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {4278#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4272#true} is VALID [2022-04-15 11:38:18,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {4272#true} assume true; {4272#true} is VALID [2022-04-15 11:38:18,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4272#true} {4272#true} #661#return; {4272#true} is VALID [2022-04-15 11:38:18,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {4272#true} call ULTIMATE.init(); {4278#(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-15 11:38:18,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {4278#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4272#true} is VALID [2022-04-15 11:38:18,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {4272#true} assume true; {4272#true} is VALID [2022-04-15 11:38:18,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4272#true} {4272#true} #661#return; {4272#true} is VALID [2022-04-15 11:38:18,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {4272#true} call #t~ret161 := main(); {4272#true} is VALID [2022-04-15 11:38:18,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {4272#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {4272#true} is VALID [2022-04-15 11:38:18,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {4272#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4272#true} is VALID [2022-04-15 11:38:18,854 INFO L272 TraceCheckUtils]: 7: Hoare triple {4272#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4272#true} is VALID [2022-04-15 11:38:18,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {4272#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;~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); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 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; {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 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; {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} [667] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse1 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse2 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse3 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse4 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse6 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse7 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse8 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse9 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse10 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse11 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|))) (or (and (= |v_#memory_$Pointer$.offset_250| |v_#memory_$Pointer$.offset_256|) .cse0 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_251| |v_#memory_int_256|) (= |v_#memory_$Pointer$.base_250| |v_#memory_$Pointer$.base_256|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|)) (and (= |v_#memory_int_256| |v_#memory_int_251|) .cse0 .cse1 (= |v_#memory_$Pointer$.offset_256| |v_#memory_$Pointer$.offset_250|) .cse2 (= |v_#memory_$Pointer$.base_256| |v_#memory_$Pointer$.base_250|) .cse3 .cse4 (= |v_ssl3_accept_#t~mem150.offset_10| |v_ssl3_accept_#t~mem150.offset_8|) (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_10|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_10|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_12|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_6|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_16, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_256|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_8} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_250|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} [666] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} 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); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,863 INFO L290 TraceCheckUtils]: 39: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {4277#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:18,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {4277#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {4273#false} is VALID [2022-04-15 11:38:18,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {4273#false} assume !false; {4273#false} is VALID [2022-04-15 11:38:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:38:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:18,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494176237] [2022-04-15 11:38:18,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494176237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:18,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:18,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:22,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:22,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113270069] [2022-04-15 11:38:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113270069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:22,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:22,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:38:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749952796] [2022-04-15 11:38:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:22,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 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-15 11:38:22,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:22,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:22,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:22,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:38:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:38:22,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:38:22,136 INFO L87 Difference]: Start difference. First operand 159 states and 238 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:24,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:26,132 INFO L93 Difference]: Finished difference Result 422 states and 641 transitions. [2022-04-15 11:38:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:38:26,132 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 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-15 11:38:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 576 transitions. [2022-04-15 11:38:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 576 transitions. [2022-04-15 11:38:26,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 576 transitions. [2022-04-15 11:38:26,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:26,529 INFO L225 Difference]: With dead ends: 422 [2022-04-15 11:38:26,529 INFO L226 Difference]: Without dead ends: 289 [2022-04-15 11:38:26,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:38:26,530 INFO L913 BasicCegarLoop]: 330 mSDtfsCounter, 136 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:26,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 1061 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 550 Invalid, 1 Unknown, 308 Unchecked, 2.6s Time] [2022-04-15 11:38:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-15 11:38:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2022-04-15 11:38:26,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:26,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,543 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,543 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:26,549 INFO L93 Difference]: Finished difference Result 289 states and 433 transitions. [2022-04-15 11:38:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 433 transitions. [2022-04-15 11:38:26,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:26,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:26,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 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 289 states. [2022-04-15 11:38:26,550 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 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 289 states. [2022-04-15 11:38:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:26,555 INFO L93 Difference]: Finished difference Result 289 states and 433 transitions. [2022-04-15 11:38:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 433 transitions. [2022-04-15 11:38:26,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:26,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:26,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:26,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2022-04-15 11:38:26,561 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 66 [2022-04-15 11:38:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:26,561 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2022-04-15 11:38:26,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:26,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 428 transitions. [2022-04-15 11:38:26,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2022-04-15 11:38:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:38:26,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:26,850 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:26,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:38:26,851 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash -560547086, now seen corresponding path program 1 times [2022-04-15 11:38:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:26,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253780114] [2022-04-15 11:38:26,978 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-15 11:38:26,980 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 168979393, now seen corresponding path program 1 times [2022-04-15 11:38:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:26,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284493811] [2022-04-15 11:38:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:27,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {6288#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6282#true} is VALID [2022-04-15 11:38:27,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {6282#true} assume true; {6282#true} is VALID [2022-04-15 11:38:27,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6282#true} {6282#true} #661#return; {6282#true} is VALID [2022-04-15 11:38:27,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {6282#true} call ULTIMATE.init(); {6288#(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-15 11:38:27,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {6288#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6282#true} is VALID [2022-04-15 11:38:27,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {6282#true} assume true; {6282#true} is VALID [2022-04-15 11:38:27,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6282#true} {6282#true} #661#return; {6282#true} is VALID [2022-04-15 11:38:27,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {6282#true} call #t~ret161 := main(); {6282#true} is VALID [2022-04-15 11:38:27,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {6282#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {6282#true} is VALID [2022-04-15 11:38:27,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {6282#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6282#true} is VALID [2022-04-15 11:38:27,110 INFO L272 TraceCheckUtils]: 7: Hoare triple {6282#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6282#true} is VALID [2022-04-15 11:38:27,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {6282#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;~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); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 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; {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 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; {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} [669] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_10| |v_ssl3_accept_#t~mem88.offset_9|)) (.cse1 (= |v_ssl3_accept_#t~mem150.offset_16| |v_ssl3_accept_#t~mem150.offset_14|)) (.cse2 (= v_ssl3_accept_~skip~0_21 v_ssl3_accept_~skip~0_20)) (.cse3 (= |v_ssl3_accept_#t~mem82_17| |v_ssl3_accept_#t~mem82_15|)) (.cse4 (= |v_ssl3_accept_#t~mem151_18| |v_ssl3_accept_#t~mem151_16|)) (.cse5 (= |v_ssl3_accept_#t~mem47_19| |v_ssl3_accept_#t~mem47_17|)) (.cse6 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_15|)) (.cse7 (= |v_ssl3_accept_#t~mem85_17| |v_ssl3_accept_#t~mem85_15|)) (.cse8 (= v_ssl3_accept_~state~0_13 v_ssl3_accept_~state~0_12)) (.cse9 (= |v_ssl3_accept_#t~mem89_10| |v_ssl3_accept_#t~mem89_9|)) (.cse10 (= |v_ssl3_accept_#t~mem150.base_16| |v_ssl3_accept_#t~mem150.base_14|)) (.cse11 (= |v_ssl3_accept_#t~mem46_11| |v_ssl3_accept_#t~mem46_10|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.base_9| |v_ssl3_accept_#t~mem88.base_10|) .cse1 .cse2 .cse3 .cse4 (= |v_#memory_$Pointer$.base_270| |v_#memory_$Pointer$.base_276|) .cse5 (= |v_#memory_int_270| |v_#memory_int_275|) .cse6 .cse7 (= |v_#memory_$Pointer$.offset_270| |v_#memory_$Pointer$.offset_276|) .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem48_15| |v_ssl3_accept_#t~mem48_17|) .cse11 (= |v_ssl3_accept_#t~mem83.base_15| |v_ssl3_accept_#t~mem83.base_17|)) (and .cse0 .cse1 (= |v_#memory_$Pointer$.base_276| |v_#memory_$Pointer$.base_270|) .cse2 .cse3 (= |v_ssl3_accept_#t~mem83.base_17| |v_ssl3_accept_#t~mem83.base_15|) .cse4 (= |v_ssl3_accept_#t~mem48_17| |v_ssl3_accept_#t~mem48_15|) .cse5 .cse6 .cse7 (= |v_#memory_int_275| |v_#memory_int_270|) .cse8 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_9|) .cse9 .cse10 .cse11 (= |v_#memory_$Pointer$.offset_276| |v_#memory_$Pointer$.offset_270|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_17|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_17|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_17|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_19|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_11|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_21, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_275|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_13} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_15|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_270|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_15|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_15|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_16|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_9|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_15|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_17|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_20, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_9|, #memory_int=|v_#memory_int_270|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_270|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_12} 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] {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} [668] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} 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); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {6287#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:27,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {6287#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {6283#false} is VALID [2022-04-15 11:38:27,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {6283#false} assume !false; {6283#false} is VALID [2022-04-15 11:38:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:38:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284493811] [2022-04-15 11:38:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284493811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:27,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:27,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:30,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:30,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253780114] [2022-04-15 11:38:30,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253780114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:30,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:30,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:38:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431336997] [2022-04-15 11:38:30,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:30,358 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 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-15 11:38:30,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:30,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:30,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:30,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:38:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:30,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:38:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:38:30,419 INFO L87 Difference]: Start difference. First operand 285 states and 428 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:32,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:33,752 INFO L93 Difference]: Finished difference Result 427 states and 642 transitions. [2022-04-15 11:38:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:38:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 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-15 11:38:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 572 transitions. [2022-04-15 11:38:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 572 transitions. [2022-04-15 11:38:33,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 572 transitions. [2022-04-15 11:38:34,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:34,126 INFO L225 Difference]: With dead ends: 427 [2022-04-15 11:38:34,126 INFO L226 Difference]: Without dead ends: 294 [2022-04-15 11:38:34,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:38:34,127 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 138 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:34,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 703 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 1 Unknown, 114 Unchecked, 2.4s Time] [2022-04-15 11:38:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-15 11:38:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 285. [2022-04-15 11:38:34,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:34,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:34,136 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:34,137 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:34,141 INFO L93 Difference]: Finished difference Result 294 states and 439 transitions. [2022-04-15 11:38:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2022-04-15 11:38:34,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:34,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:34,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 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 294 states. [2022-04-15 11:38:34,142 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 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 294 states. [2022-04-15 11:38:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:34,146 INFO L93 Difference]: Finished difference Result 294 states and 439 transitions. [2022-04-15 11:38:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2022-04-15 11:38:34,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:34,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:34,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:34,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.5142857142857142) internal successors, (424), 280 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2022-04-15 11:38:34,152 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 66 [2022-04-15 11:38:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:34,152 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2022-04-15 11:38:34,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:34,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 428 transitions. [2022-04-15 11:38:34,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2022-04-15 11:38:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:38:34,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:34,460 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:34,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:38:34,461 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1712111703, now seen corresponding path program 1 times [2022-04-15 11:38:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376919394] [2022-04-15 11:38:34,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:38:34,481 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:38:34,481 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:34,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1712111703, now seen corresponding path program 2 times [2022-04-15 11:38:34,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:34,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930341870] [2022-04-15 11:38:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:34,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {8319#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8312#true} is VALID [2022-04-15 11:38:34,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {8312#true} assume true; {8312#true} is VALID [2022-04-15 11:38:34,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8312#true} {8312#true} #661#return; {8312#true} is VALID [2022-04-15 11:38:34,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {8312#true} call ULTIMATE.init(); {8319#(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-15 11:38:34,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {8319#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8312#true} is VALID [2022-04-15 11:38:34,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {8312#true} assume true; {8312#true} is VALID [2022-04-15 11:38:34,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8312#true} {8312#true} #661#return; {8312#true} is VALID [2022-04-15 11:38:34,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {8312#true} call #t~ret161 := main(); {8312#true} is VALID [2022-04-15 11:38:34,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {8312#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {8312#true} is VALID [2022-04-15 11:38:34,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {8312#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8312#true} is VALID [2022-04-15 11:38:34,578 INFO L272 TraceCheckUtils]: 7: Hoare triple {8312#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8312#true} is VALID [2022-04-15 11:38:34,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {8312#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;~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); {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {8317#(= 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; {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {8317#(= 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; {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {8317#(= 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)))); {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {8317#(= 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); {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {8317#(= 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; {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {8317#(= 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); {8317#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:34,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {8317#(= 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); {8318#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {8318#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {8313#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {8313#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {8313#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {8313#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); {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {8313#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {8313#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); {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {8313#false} assume 12292 != #t~mem85;havoc #t~mem85; {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {8313#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {8313#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); {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {8313#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8313#false} is VALID [2022-04-15 11:38:34,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {8313#false} ~skip~0 := 0; {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {8313#false} assume !false; {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {8313#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); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {8313#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {8313#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {8313#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {8313#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {8313#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {8313#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {8313#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {8313#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {8313#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {8313#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {8313#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {8313#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {8313#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {8313#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {8313#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {8313#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {8313#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {8313#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {8313#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {8313#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {8313#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {8313#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {8313#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {8313#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 55: Hoare triple {8313#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {8313#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {8313#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {8313#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 59: Hoare triple {8313#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 60: Hoare triple {8313#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {8313#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {8313#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {8313#false} assume 8672 == #t~mem79;havoc #t~mem79; {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {8313#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {8313#false} assume 3 == ~blastFlag~0; {8313#false} is VALID [2022-04-15 11:38:34,587 INFO L290 TraceCheckUtils]: 66: Hoare triple {8313#false} assume !false; {8313#false} is VALID [2022-04-15 11:38:34,588 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-15 11:38:34,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:34,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930341870] [2022-04-15 11:38:34,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930341870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:34,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:34,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:34,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:34,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376919394] [2022-04-15 11:38:34,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376919394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:34,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:34,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:34,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399352003] [2022-04-15 11:38:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:34,589 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-15 11:38:34,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:34,589 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-15 11:38:34,637 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-15 11:38:34,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:34,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:34,638 INFO L87 Difference]: Start difference. First operand 285 states and 428 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-15 11:38:36,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:37,622 INFO L93 Difference]: Finished difference Result 441 states and 658 transitions. [2022-04-15 11:38:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:37,622 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-15 11:38:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:37,623 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-15 11:38:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-15 11:38:37,625 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-15 11:38:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-15 11:38:37,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-15 11:38:37,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:37,923 INFO L225 Difference]: With dead ends: 441 [2022-04-15 11:38:37,924 INFO L226 Difference]: Without dead ends: 301 [2022-04-15 11:38:37,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:37,925 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 25 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:37,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-15 11:38:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 285. [2022-04-15 11:38:37,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:37,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:37,934 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:37,935 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:37,939 INFO L93 Difference]: Finished difference Result 301 states and 446 transitions. [2022-04-15 11:38:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 446 transitions. [2022-04-15 11:38:37,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:37,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:37,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 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 301 states. [2022-04-15 11:38:37,941 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 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 301 states. [2022-04-15 11:38:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:37,945 INFO L93 Difference]: Finished difference Result 301 states and 446 transitions. [2022-04-15 11:38:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 446 transitions. [2022-04-15 11:38:37,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:37,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:37,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:37,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2022-04-15 11:38:37,958 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 67 [2022-04-15 11:38:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:37,958 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2022-04-15 11:38:37,959 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-15 11:38:37,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 427 transitions. [2022-04-15 11:38:38,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2022-04-15 11:38:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:38:38,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:38,275 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:38,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:38:38,275 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 1 times [2022-04-15 11:38:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:38,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260065266] [2022-04-15 11:38:38,422 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-15 11:38:38,422 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1589220225, now seen corresponding path program 1 times [2022-04-15 11:38:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:38,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827284209] [2022-04-15 11:38:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:38,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {10384#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10378#true} is VALID [2022-04-15 11:38:38,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {10378#true} assume true; {10378#true} is VALID [2022-04-15 11:38:38,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10378#true} {10378#true} #661#return; {10378#true} is VALID [2022-04-15 11:38:38,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {10378#true} call ULTIMATE.init(); {10384#(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-15 11:38:38,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {10384#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10378#true} is VALID [2022-04-15 11:38:38,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {10378#true} assume true; {10378#true} is VALID [2022-04-15 11:38:38,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10378#true} {10378#true} #661#return; {10378#true} is VALID [2022-04-15 11:38:38,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {10378#true} call #t~ret161 := main(); {10378#true} is VALID [2022-04-15 11:38:38,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {10378#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {10378#true} is VALID [2022-04-15 11:38:38,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {10378#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10378#true} is VALID [2022-04-15 11:38:38,544 INFO L272 TraceCheckUtils]: 7: Hoare triple {10378#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10378#true} is VALID [2022-04-15 11:38:38,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {10378#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;~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); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 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; {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 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; {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} [671] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_int_305| |v_#memory_int_300|)) (.cse1 (= |v_ssl3_accept_#t~mem47_28| |v_ssl3_accept_#t~mem47_26|)) (.cse2 (= |v_ssl3_accept_#t~mem49_10| |v_ssl3_accept_#t~mem49_8|)) (.cse3 (= |v_ssl3_accept_#t~mem83.base_26| |v_ssl3_accept_#t~mem83.base_24|)) (.cse4 (= |v_ssl3_accept_#t~mem83.offset_26| |v_ssl3_accept_#t~mem83.offset_24|)) (.cse5 (= |v_ssl3_accept_#t~mem150.base_24| |v_ssl3_accept_#t~mem150.base_22|)) (.cse6 (= |v_ssl3_accept_#t~mem88.offset_15| |v_ssl3_accept_#t~mem88.offset_14|)) (.cse7 (= |v_ssl3_accept_#t~mem82_26| |v_ssl3_accept_#t~mem82_24|)) (.cse8 (= v_ssl3_accept_~skip~0_27 v_ssl3_accept_~skip~0_26)) (.cse9 (= |v_ssl3_accept_#t~mem88.base_15| |v_ssl3_accept_#t~mem88.base_14|)) (.cse10 (= |v_ssl3_accept_#t~mem89_15| |v_ssl3_accept_#t~mem89_14|)) (.cse11 (= |v_ssl3_accept_#t~mem85_26| |v_ssl3_accept_#t~mem85_24|)) (.cse12 (= |v_ssl3_accept_#t~mem150.offset_24| |v_ssl3_accept_#t~mem150.offset_22|)) (.cse13 (= |v_ssl3_accept_#t~mem151_26| |v_ssl3_accept_#t~mem151_24|)) (.cse14 (= v_ssl3_accept_~state~0_19 v_ssl3_accept_~state~0_18)) (.cse15 (= |v_ssl3_accept_#t~mem48_26| |v_ssl3_accept_#t~mem48_24|)) (.cse16 (= |v_ssl3_accept_#t~mem46_17| |v_ssl3_accept_#t~mem46_16|))) (or (and .cse0 .cse1 .cse2 (= |v_#memory_$Pointer$.offset_317| |v_#memory_$Pointer$.offset_311|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |v_#memory_$Pointer$.base_317| |v_#memory_$Pointer$.base_311|)) (and (= |v_#memory_$Pointer$.offset_311| |v_#memory_$Pointer$.offset_317|) .cse0 (= |v_#memory_$Pointer$.base_311| |v_#memory_$Pointer$.base_317|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_317|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_26|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_26|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_15|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_26|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_26|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_24|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_28|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_17|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_27, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_15|, #memory_int=|v_#memory_int_305|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_317|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_19} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_311|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_24|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_24|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_24|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_22|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_14|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_24|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_24|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_22|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_26|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_26, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_14|, #memory_int=|v_#memory_int_300|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_311|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18} 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~mem49, 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] {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} [670] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} 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); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {10383#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:38,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {10383#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {10379#false} is VALID [2022-04-15 11:38:38,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {10379#false} assume !false; {10379#false} is VALID [2022-04-15 11:38:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:38:38,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:38,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827284209] [2022-04-15 11:38:38,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827284209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:38,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:38,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:41,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:41,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260065266] [2022-04-15 11:38:41,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260065266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:41,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:41,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:38:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152939529] [2022-04-15 11:38:41,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:41,895 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:41,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:41,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:41,954 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-15 11:38:41,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:38:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:38:41,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:41,955 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:43,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:45,475 INFO L93 Difference]: Finished difference Result 430 states and 645 transitions. [2022-04-15 11:38:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:38:45,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 572 transitions. [2022-04-15 11:38:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 572 transitions. [2022-04-15 11:38:45,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 572 transitions. [2022-04-15 11:38:45,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:45,874 INFO L225 Difference]: With dead ends: 430 [2022-04-15 11:38:45,874 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 11:38:45,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:45,875 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 135 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:45,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 784 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 535 Invalid, 1 Unknown, 398 Unchecked, 2.5s Time] [2022-04-15 11:38:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 11:38:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 287. [2022-04-15 11:38:45,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:45,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 287 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 282 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:45,884 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 287 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 282 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:45,885 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 287 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 282 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:45,889 INFO L93 Difference]: Finished difference Result 297 states and 442 transitions. [2022-04-15 11:38:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2022-04-15 11:38:45,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:45,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:45,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 282 states have internal predecessors, (426), 3 states have call successors, (3), 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 297 states. [2022-04-15 11:38:45,891 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 282 states have internal predecessors, (426), 3 states have call successors, (3), 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 297 states. [2022-04-15 11:38:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:45,895 INFO L93 Difference]: Finished difference Result 297 states and 442 transitions. [2022-04-15 11:38:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2022-04-15 11:38:45,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:45,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:45,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:45,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5106382978723405) internal successors, (426), 282 states have internal predecessors, (426), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 430 transitions. [2022-04-15 11:38:45,901 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 430 transitions. Word has length 67 [2022-04-15 11:38:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:45,901 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 430 transitions. [2022-04-15 11:38:45,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:45,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 430 transitions. [2022-04-15 11:38:46,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 430 transitions. [2022-04-15 11:38:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:38:46,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:46,509 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:46,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:38:46,509 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:46,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 174124247, now seen corresponding path program 1 times [2022-04-15 11:38:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:46,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850621337] [2022-04-15 11:38:46,647 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-15 11:38:46,647 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:38:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1285506239, now seen corresponding path program 1 times [2022-04-15 11:38:46,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:46,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878266006] [2022-04-15 11:38:46,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:46,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:46,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {12431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12425#true} is VALID [2022-04-15 11:38:46,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {12425#true} assume true; {12425#true} is VALID [2022-04-15 11:38:46,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12425#true} {12425#true} #661#return; {12425#true} is VALID [2022-04-15 11:38:46,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {12425#true} call ULTIMATE.init(); {12431#(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-15 11:38:46,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {12431#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12425#true} is VALID [2022-04-15 11:38:46,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {12425#true} assume true; {12425#true} is VALID [2022-04-15 11:38:46,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12425#true} {12425#true} #661#return; {12425#true} is VALID [2022-04-15 11:38:46,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {12425#true} call #t~ret161 := main(); {12425#true} is VALID [2022-04-15 11:38:46,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {12425#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {12425#true} is VALID [2022-04-15 11:38:46,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {12425#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12425#true} is VALID [2022-04-15 11:38:46,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {12425#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12425#true} is VALID [2022-04-15 11:38:46,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {12425#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;~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); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 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; {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 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; {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} [673] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_33| |v_ssl3_accept_#t~mem82_31|)) (.cse1 (= |v_ssl3_accept_#t~mem89_20| |v_ssl3_accept_#t~mem89_19|)) (.cse2 (= |v_ssl3_accept_#t~mem85_33| |v_ssl3_accept_#t~mem85_31|)) (.cse3 (= v_ssl3_accept_~skip~0_32 v_ssl3_accept_~skip~0_31)) (.cse4 (= |v_ssl3_accept_#t~mem151_32| |v_ssl3_accept_#t~mem151_30|)) (.cse5 (= |v_ssl3_accept_#t~mem83.base_33| |v_ssl3_accept_#t~mem83.base_31|)) (.cse6 (= |v_ssl3_accept_#t~mem46_22| |v_ssl3_accept_#t~mem46_21|)) (.cse7 (= |v_ssl3_accept_#t~mem47_35| |v_ssl3_accept_#t~mem47_33|)) (.cse8 (= v_ssl3_accept_~state~0_24 v_ssl3_accept_~state~0_23)) (.cse9 (= |v_ssl3_accept_#t~mem83.offset_33| |v_ssl3_accept_#t~mem83.offset_31|)) (.cse10 (= |v_ssl3_accept_#t~mem48_33| |v_ssl3_accept_#t~mem48_31|))) (or (and (= |v_ssl3_accept_#t~mem150.offset_28| |v_ssl3_accept_#t~mem150.offset_30|) .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem150.base_28| |v_ssl3_accept_#t~mem150.base_30|) (= |v_ssl3_accept_#t~mem88.base_19| |v_ssl3_accept_#t~mem88.base_20|) .cse3 .cse4 .cse5 (= |v_#memory_$Pointer$.base_331| |v_#memory_$Pointer$.base_337|) (= |v_ssl3_accept_#t~mem88.offset_19| |v_ssl3_accept_#t~mem88.offset_20|) .cse6 .cse7 .cse8 .cse9 (= |v_#memory_int_319| |v_#memory_int_324|) (= |v_#memory_$Pointer$.offset_331| |v_#memory_$Pointer$.offset_337|) (= |v_ssl3_accept_#t~mem49_15| |v_ssl3_accept_#t~mem49_17|) .cse10) (and .cse0 (= |v_#memory_int_324| |v_#memory_int_319|) (= |v_#memory_$Pointer$.base_337| |v_#memory_$Pointer$.base_331|) .cse1 .cse2 (= |v_#memory_$Pointer$.offset_337| |v_#memory_$Pointer$.offset_331|) (= |v_ssl3_accept_#t~mem49_17| |v_ssl3_accept_#t~mem49_15|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_28|) .cse6 .cse7 .cse8 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_28|) .cse9 (= |v_ssl3_accept_#t~mem88.base_20| |v_ssl3_accept_#t~mem88.base_19|) .cse10 (= |v_ssl3_accept_#t~mem88.offset_20| |v_ssl3_accept_#t~mem88.offset_19|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_337|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_33|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_33|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_30|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_20|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_33|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_33|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_35|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_22|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_32, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_20|, #memory_int=|v_#memory_int_324|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_337|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_24} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_331|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_31|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_31|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_19|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_31|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_33|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_21|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_31, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_19|, #memory_int=|v_#memory_int_319|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_19|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_331|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_23} 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~mem49, 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] {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} [672] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} 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); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {12430#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:38:46,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {12430#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {12426#false} is VALID [2022-04-15 11:38:46,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {12426#false} assume !false; {12426#false} is VALID [2022-04-15 11:38:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:38:46,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:46,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878266006] [2022-04-15 11:38:46,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878266006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:46,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:46,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:38:49,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:49,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850621337] [2022-04-15 11:38:49,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850621337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:49,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:49,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:38:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033635599] [2022-04-15 11:38:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:49,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:49,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:49,645 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-15 11:38:49,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:38:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:38:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:49,646 INFO L87 Difference]: Start difference. First operand 287 states and 430 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:51,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:53,858 INFO L93 Difference]: Finished difference Result 430 states and 645 transitions. [2022-04-15 11:38:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:38:53,858 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 572 transitions. [2022-04-15 11:38:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 572 transitions. [2022-04-15 11:38:53,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 572 transitions. [2022-04-15 11:38:54,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:54,278 INFO L225 Difference]: With dead ends: 430 [2022-04-15 11:38:54,279 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 11:38:54,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:38:54,279 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 137 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:54,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 877 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 626 Invalid, 1 Unknown, 280 Unchecked, 2.7s Time] [2022-04-15 11:38:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 11:38:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2022-04-15 11:38:54,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:54,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:54,288 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:54,289 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:54,293 INFO L93 Difference]: Finished difference Result 297 states and 442 transitions. [2022-04-15 11:38:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2022-04-15 11:38:54,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:54,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:54,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 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 297 states. [2022-04-15 11:38:54,294 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 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 297 states. [2022-04-15 11:38:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:54,298 INFO L93 Difference]: Finished difference Result 297 states and 442 transitions. [2022-04-15 11:38:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2022-04-15 11:38:54,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:54,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:54,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:54,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 280 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2022-04-15 11:38:54,304 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 67 [2022-04-15 11:38:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:54,304 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2022-04-15 11:38:54,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 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-15 11:38:54,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 427 transitions. [2022-04-15 11:38:55,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2022-04-15 11:38:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:38:55,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:55,248 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:55,248 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:38:55,248 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash -412136860, now seen corresponding path program 1 times [2022-04-15 11:38:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:55,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [88638351] [2022-04-15 11:38:55,266 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:38:55,266 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:38:55,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash -412136860, now seen corresponding path program 2 times [2022-04-15 11:38:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:55,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145946831] [2022-04-15 11:38:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:55,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {14475#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14468#true} is VALID [2022-04-15 11:38:55,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {14468#true} assume true; {14468#true} is VALID [2022-04-15 11:38:55,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14468#true} {14468#true} #661#return; {14468#true} is VALID [2022-04-15 11:38:55,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {14468#true} call ULTIMATE.init(); {14475#(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-15 11:38:55,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {14475#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14468#true} is VALID [2022-04-15 11:38:55,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {14468#true} assume true; {14468#true} is VALID [2022-04-15 11:38:55,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14468#true} {14468#true} #661#return; {14468#true} is VALID [2022-04-15 11:38:55,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {14468#true} call #t~ret161 := main(); {14468#true} is VALID [2022-04-15 11:38:55,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {14468#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {14468#true} is VALID [2022-04-15 11:38:55,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {14468#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14468#true} is VALID [2022-04-15 11:38:55,387 INFO L272 TraceCheckUtils]: 7: Hoare triple {14468#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14468#true} is VALID [2022-04-15 11:38:55,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {14468#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;~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); {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {14473#(= 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; {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {14473#(= 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; {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {14473#(= 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)))); {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {14473#(= 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); {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {14473#(= 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; {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {14473#(= 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); {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {14473#(= 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); {14473#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:38:55,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {14473#(= 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); {14474#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {14474#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {14469#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {14469#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {14469#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {14469#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); {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {14469#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {14469#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); {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {14469#false} assume 12292 != #t~mem85;havoc #t~mem85; {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {14469#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {14469#false} is VALID [2022-04-15 11:38:55,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {14469#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); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {14469#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {14469#false} ~skip~0 := 0; {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {14469#false} assume !false; {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {14469#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); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {14469#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {14469#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {14469#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {14469#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {14469#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {14469#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {14469#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {14469#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {14469#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {14469#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {14469#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {14469#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {14469#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {14469#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 46: Hoare triple {14469#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 47: Hoare triple {14469#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {14469#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {14469#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {14469#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 51: Hoare triple {14469#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {14469#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {14469#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {14469#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {14469#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {14469#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {14469#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {14469#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {14469#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {14469#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {14469#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {14469#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {14469#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {14469#false} assume 8672 == #t~mem79;havoc #t~mem79; {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {14469#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {14469#false} assume 3 == ~blastFlag~0; {14469#false} is VALID [2022-04-15 11:38:55,396 INFO L290 TraceCheckUtils]: 67: Hoare triple {14469#false} assume !false; {14469#false} is VALID [2022-04-15 11:38:55,396 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-15 11:38:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:55,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145946831] [2022-04-15 11:38:55,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145946831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:55,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:55,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:55,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:55,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [88638351] [2022-04-15 11:38:55,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [88638351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:55,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:55,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21046713] [2022-04-15 11:38:55,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:55,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:55,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:55,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:55,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:55,446 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:57,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:38:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:59,081 INFO L93 Difference]: Finished difference Result 441 states and 657 transitions. [2022-04-15 11:38:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:38:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2022-04-15 11:38:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2022-04-15 11:38:59,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 426 transitions. [2022-04-15 11:38:59,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:59,371 INFO L225 Difference]: With dead ends: 441 [2022-04-15 11:38:59,372 INFO L226 Difference]: Without dead ends: 301 [2022-04-15 11:38:59,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:38:59,372 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 23 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:59,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 11:38:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-15 11:38:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 285. [2022-04-15 11:38:59,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:59,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 285 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:59,381 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 285 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:59,382 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 285 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:59,385 INFO L93 Difference]: Finished difference Result 301 states and 445 transitions. [2022-04-15 11:38:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 445 transitions. [2022-04-15 11:38:59,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:59,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:59,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-15 11:38:59,387 INFO L87 Difference]: Start difference. First operand has 285 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-15 11:38:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:59,391 INFO L93 Difference]: Finished difference Result 301 states and 445 transitions. [2022-04-15 11:38:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 445 transitions. [2022-04-15 11:38:59,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:59,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:59,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:59,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.5071428571428571) internal successors, (422), 280 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 426 transitions. [2022-04-15 11:38:59,396 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 426 transitions. Word has length 68 [2022-04-15 11:38:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:59,396 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 426 transitions. [2022-04-15 11:38:59,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:38:59,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 426 transitions. [2022-04-15 11:39:00,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 426 transitions. [2022-04-15 11:39:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:39:00,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:00,376 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:00,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:39:00,376 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 1 times [2022-04-15 11:39:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:00,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [357752501] [2022-04-15 11:39:00,551 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-15 11:39:00,551 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:39:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 134734593, now seen corresponding path program 1 times [2022-04-15 11:39:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254209808] [2022-04-15 11:39:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:00,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {16540#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16534#true} is VALID [2022-04-15 11:39:00,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {16534#true} assume true; {16534#true} is VALID [2022-04-15 11:39:00,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16534#true} {16534#true} #661#return; {16534#true} is VALID [2022-04-15 11:39:00,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {16534#true} call ULTIMATE.init(); {16540#(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-15 11:39:00,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {16540#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16534#true} is VALID [2022-04-15 11:39:00,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {16534#true} assume true; {16534#true} is VALID [2022-04-15 11:39:00,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16534#true} {16534#true} #661#return; {16534#true} is VALID [2022-04-15 11:39:00,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {16534#true} call #t~ret161 := main(); {16534#true} is VALID [2022-04-15 11:39:00,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {16534#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {16534#true} is VALID [2022-04-15 11:39:00,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {16534#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16534#true} is VALID [2022-04-15 11:39:00,668 INFO L272 TraceCheckUtils]: 7: Hoare triple {16534#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16534#true} is VALID [2022-04-15 11:39:00,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {16534#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;~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); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 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; {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 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; {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} [675] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_42| |v_ssl3_accept_#t~mem82_40|)) (.cse1 (= |v_ssl3_accept_#t~mem83.offset_42| |v_ssl3_accept_#t~mem83.offset_40|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_38| |v_ssl3_accept_#t~mem150.offset_36|)) (.cse3 (= |v_ssl3_accept_#t~mem46_28| |v_ssl3_accept_#t~mem46_27|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_25| |v_ssl3_accept_#t~mem88.base_24|)) (.cse5 (= |v_ssl3_accept_#t~mem50_10| |v_ssl3_accept_#t~mem50_8|)) (.cse6 (= |v_ssl3_accept_#t~mem89_25| |v_ssl3_accept_#t~mem89_24|)) (.cse7 (= |v_ssl3_accept_#t~mem83.base_42| |v_ssl3_accept_#t~mem83.base_40|)) (.cse8 (= |v_ssl3_accept_#t~mem48_42| |v_ssl3_accept_#t~mem48_40|)) (.cse9 (= |v_ssl3_accept_#t~mem47_44| |v_ssl3_accept_#t~mem47_42|)) (.cse10 (= v_ssl3_accept_~skip~0_38 v_ssl3_accept_~skip~0_37)) (.cse11 (= |v_ssl3_accept_#t~mem150.base_38| |v_ssl3_accept_#t~mem150.base_36|)) (.cse12 (= |v_ssl3_accept_#t~mem49_26| |v_ssl3_accept_#t~mem49_24|)) (.cse13 (= |v_ssl3_accept_#t~mem88.offset_25| |v_ssl3_accept_#t~mem88.offset_24|))) (or (and .cse0 .cse1 (= |v_#memory_$Pointer$.offset_372| |v_#memory_$Pointer$.offset_378|) .cse2 (= |v_ssl3_accept_#t~mem151_38| |v_ssl3_accept_#t~mem151_40|) .cse3 .cse4 (= |v_#memory_$Pointer$.base_372| |v_#memory_$Pointer$.base_378|) .cse5 .cse6 .cse7 (= v_ssl3_accept_~state~0_29 v_ssl3_accept_~state~0_30) (= |v_#memory_int_349| |v_#memory_int_354|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |v_ssl3_accept_#t~mem85_40| |v_ssl3_accept_#t~mem85_42|)) (and .cse0 .cse1 .cse2 (= |v_#memory_$Pointer$.offset_378| |v_#memory_$Pointer$.offset_372|) .cse3 .cse4 (= v_ssl3_accept_~state~0_30 v_ssl3_accept_~state~0_29) .cse5 .cse6 .cse7 .cse8 (= |v_#memory_int_354| |v_#memory_int_349|) (= |v_ssl3_accept_#t~mem151_40| |v_ssl3_accept_#t~mem151_38|) (= |v_#memory_$Pointer$.base_378| |v_#memory_$Pointer$.base_372|) .cse9 (= |v_ssl3_accept_#t~mem85_42| |v_ssl3_accept_#t~mem85_40|) .cse10 .cse11 .cse12 .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_378|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_42|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_42|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_40|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_38|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_25|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_42|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_26|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_42|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_38|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_44|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_38, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_25|, #memory_int=|v_#memory_int_354|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_25|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_378|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_30} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_40|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_372|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_40|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_40|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_38|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_36|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_24|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_40|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_40|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_36|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_42|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_27|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_37, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_24|, #memory_int=|v_#memory_int_349|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_372|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_29} 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~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, 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] {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} [674] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} 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); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16539#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:00,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {16539#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {16535#false} is VALID [2022-04-15 11:39:00,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {16535#false} assume !false; {16535#false} is VALID [2022-04-15 11:39:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:39:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254209808] [2022-04-15 11:39:00,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254209808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:00,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:00,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:39:04,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:04,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [357752501] [2022-04-15 11:39:04,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [357752501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:04,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:04,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:39:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354347993] [2022-04-15 11:39:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:04,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:39:04,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:04,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:04,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:04,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:39:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:39:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:39:04,940 INFO L87 Difference]: Start difference. First operand 285 states and 426 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:06,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:08,276 INFO L93 Difference]: Finished difference Result 429 states and 642 transitions. [2022-04-15 11:39:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:39:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:39:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 420 transitions. [2022-04-15 11:39:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 420 transitions. [2022-04-15 11:39:08,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 420 transitions. [2022-04-15 11:39:08,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:08,548 INFO L225 Difference]: With dead ends: 429 [2022-04-15 11:39:08,548 INFO L226 Difference]: Without dead ends: 296 [2022-04-15 11:39:08,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:39:08,549 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 8 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:08,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 426 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 1 Unknown, 135 Unchecked, 2.4s Time] [2022-04-15 11:39:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-15 11:39:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 287. [2022-04-15 11:39:08,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:08,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,559 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,560 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:08,563 INFO L93 Difference]: Finished difference Result 296 states and 439 transitions. [2022-04-15 11:39:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 439 transitions. [2022-04-15 11:39:08,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:08,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:08,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 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 296 states. [2022-04-15 11:39:08,565 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 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 296 states. [2022-04-15 11:39:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:08,568 INFO L93 Difference]: Finished difference Result 296 states and 439 transitions. [2022-04-15 11:39:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 439 transitions. [2022-04-15 11:39:08,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:08,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:08,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:08,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 429 transitions. [2022-04-15 11:39:08,574 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 429 transitions. Word has length 68 [2022-04-15 11:39:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:08,574 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 429 transitions. [2022-04-15 11:39:08,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:08,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 429 transitions. [2022-04-15 11:39:10,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 429 transitions. [2022-04-15 11:39:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:39:10,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:10,610 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:10,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:39:10,611 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:10,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1435302295, now seen corresponding path program 1 times [2022-04-15 11:39:10,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:10,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126125404] [2022-04-15 11:39:10,811 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-15 11:39:10,811 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:39:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1554975425, now seen corresponding path program 1 times [2022-04-15 11:39:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625560] [2022-04-15 11:39:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:10,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {18584#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18578#true} is VALID [2022-04-15 11:39:10,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {18578#true} assume true; {18578#true} is VALID [2022-04-15 11:39:10,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18578#true} {18578#true} #661#return; {18578#true} is VALID [2022-04-15 11:39:10,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {18578#true} call ULTIMATE.init(); {18584#(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-15 11:39:10,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {18584#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18578#true} is VALID [2022-04-15 11:39:10,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {18578#true} assume true; {18578#true} is VALID [2022-04-15 11:39:10,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18578#true} {18578#true} #661#return; {18578#true} is VALID [2022-04-15 11:39:10,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {18578#true} call #t~ret161 := main(); {18578#true} is VALID [2022-04-15 11:39:10,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {18578#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {18578#true} is VALID [2022-04-15 11:39:10,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {18578#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18578#true} is VALID [2022-04-15 11:39:10,948 INFO L272 TraceCheckUtils]: 7: Hoare triple {18578#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18578#true} is VALID [2022-04-15 11:39:10,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {18578#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;~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); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 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; {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 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; {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} [677] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_30| |v_ssl3_accept_#t~mem88.offset_29|)) (.cse1 (= |v_ssl3_accept_#t~mem82_49| |v_ssl3_accept_#t~mem82_47|)) (.cse2 (= |v_ssl3_accept_#t~mem150.base_44| |v_ssl3_accept_#t~mem150.base_42|)) (.cse3 (= |v_ssl3_accept_#t~mem85_49| |v_ssl3_accept_#t~mem85_47|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_30| |v_ssl3_accept_#t~mem88.base_29|)) (.cse5 (= |v_ssl3_accept_#t~mem46_33| |v_ssl3_accept_#t~mem46_32|)) (.cse6 (= |v_ssl3_accept_#t~mem150.offset_44| |v_ssl3_accept_#t~mem150.offset_42|)) (.cse7 (= v_ssl3_accept_~state~0_35 v_ssl3_accept_~state~0_34)) (.cse8 (= |v_ssl3_accept_#t~mem49_33| |v_ssl3_accept_#t~mem49_31|)) (.cse9 (= |v_ssl3_accept_#t~mem151_46| |v_ssl3_accept_#t~mem151_44|)) (.cse10 (= |v_ssl3_accept_#t~mem50_17| |v_ssl3_accept_#t~mem50_15|)) (.cse11 (= |v_ssl3_accept_#t~mem83.offset_49| |v_ssl3_accept_#t~mem83.offset_47|)) (.cse12 (= v_ssl3_accept_~skip~0_43 v_ssl3_accept_~skip~0_42))) (or (and (= |v_ssl3_accept_#t~mem48_49| |v_ssl3_accept_#t~mem48_47|) .cse0 .cse1 .cse2 .cse3 (= |v_ssl3_accept_#t~mem89_30| |v_ssl3_accept_#t~mem89_29|) .cse4 .cse5 .cse6 (= |v_#memory_int_373| |v_#memory_int_368|) .cse7 .cse8 .cse9 (= |v_#memory_$Pointer$.offset_398| |v_#memory_$Pointer$.offset_392|) (= |v_#memory_$Pointer$.base_398| |v_#memory_$Pointer$.base_392|) .cse10 (= |v_ssl3_accept_#t~mem83.base_49| |v_ssl3_accept_#t~mem83.base_47|) (= |v_ssl3_accept_#t~mem47_51| |v_ssl3_accept_#t~mem47_49|) .cse11 .cse12) (and (= |v_ssl3_accept_#t~mem89_29| |v_ssl3_accept_#t~mem89_30|) (= |v_#memory_int_368| |v_#memory_int_373|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem83.base_47| |v_ssl3_accept_#t~mem83.base_49|) (= |v_#memory_$Pointer$.offset_392| |v_#memory_$Pointer$.offset_398|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_#memory_$Pointer$.base_392| |v_#memory_$Pointer$.base_398|) (= |v_ssl3_accept_#t~mem47_49| |v_ssl3_accept_#t~mem47_51|) .cse11 (= |v_ssl3_accept_#t~mem48_47| |v_ssl3_accept_#t~mem48_49|) .cse12))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_398|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_49|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_49|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_46|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_44|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_17|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_30|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_49|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_33|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_49|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_44|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_51|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_33|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_43, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_30|, #memory_int=|v_#memory_int_373|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_30|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_398|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_35} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_392|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_47|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_47|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_44|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_42|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_15|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_29|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_47|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_31|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_47|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_42|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_49|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_42, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_29|, #memory_int=|v_#memory_int_368|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_29|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_392|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_34} 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~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, 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] {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} [676] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} 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); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,958 INFO L290 TraceCheckUtils]: 42: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {18583#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:10,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {18583#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {18579#false} is VALID [2022-04-15 11:39:10,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {18579#false} assume !false; {18579#false} is VALID [2022-04-15 11:39:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:39:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:10,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625560] [2022-04-15 11:39:10,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:10,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:10,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:39:14,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:14,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126125404] [2022-04-15 11:39:14,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126125404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:14,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:14,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:39:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280015382] [2022-04-15 11:39:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:39:14,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:14,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:14,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:14,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:39:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:39:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:39:14,666 INFO L87 Difference]: Start difference. First operand 287 states and 429 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:16,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:20,819 INFO L93 Difference]: Finished difference Result 433 states and 648 transitions. [2022-04-15 11:39:20,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:39:20,819 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:39:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 572 transitions. [2022-04-15 11:39:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 572 transitions. [2022-04-15 11:39:20,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 572 transitions. [2022-04-15 11:39:21,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:21,187 INFO L225 Difference]: With dead ends: 433 [2022-04-15 11:39:21,187 INFO L226 Difference]: Without dead ends: 300 [2022-04-15 11:39:21,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:39:21,188 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 134 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:21,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 993 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 665 Invalid, 1 Unknown, 460 Unchecked, 3.2s Time] [2022-04-15 11:39:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-15 11:39:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 287. [2022-04-15 11:39:21,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:21,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:21,201 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:21,212 INFO L87 Difference]: Start difference. First operand 300 states. Second operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:21,216 INFO L93 Difference]: Finished difference Result 300 states and 445 transitions. [2022-04-15 11:39:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 445 transitions. [2022-04-15 11:39:21,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:21,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:21,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 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 300 states. [2022-04-15 11:39:21,217 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 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 300 states. [2022-04-15 11:39:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:21,221 INFO L93 Difference]: Finished difference Result 300 states and 445 transitions. [2022-04-15 11:39:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 445 transitions. [2022-04-15 11:39:21,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:21,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:21,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:21,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 282 states have internal predecessors, (425), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 429 transitions. [2022-04-15 11:39:21,226 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 429 transitions. Word has length 68 [2022-04-15 11:39:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:21,226 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 429 transitions. [2022-04-15 11:39:21,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:21,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 429 transitions. [2022-04-15 11:39:23,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 428 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 429 transitions. [2022-04-15 11:39:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:39:23,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:23,716 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:23,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:39:23,716 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 29676964, now seen corresponding path program 1 times [2022-04-15 11:39:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:23,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930433637] [2022-04-15 11:39:23,764 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:39:23,764 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:39:23,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash 29676964, now seen corresponding path program 2 times [2022-04-15 11:39:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:23,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573049077] [2022-04-15 11:39:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:23,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {20645#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20638#true} is VALID [2022-04-15 11:39:23,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {20638#true} assume true; {20638#true} is VALID [2022-04-15 11:39:23,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20638#true} {20638#true} #661#return; {20638#true} is VALID [2022-04-15 11:39:23,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {20638#true} call ULTIMATE.init(); {20645#(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-15 11:39:23,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {20645#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20638#true} is VALID [2022-04-15 11:39:23,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {20638#true} assume true; {20638#true} is VALID [2022-04-15 11:39:23,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20638#true} {20638#true} #661#return; {20638#true} is VALID [2022-04-15 11:39:23,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {20638#true} call #t~ret161 := main(); {20638#true} is VALID [2022-04-15 11:39:23,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {20638#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {20638#true} is VALID [2022-04-15 11:39:23,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {20638#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20638#true} is VALID [2022-04-15 11:39:23,943 INFO L272 TraceCheckUtils]: 7: Hoare triple {20638#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20638#true} is VALID [2022-04-15 11:39:23,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {20638#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;~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); {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {20643#(= 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; {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {20643#(= 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; {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {20643#(= 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)))); {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {20643#(= 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); {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {20643#(= 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; {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {20643#(= 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); {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {20643#(= 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); {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {20643#(= 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); {20643#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:23,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {20643#(= 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); {20644#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-15 11:39:23,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {20644#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {20639#false} is VALID [2022-04-15 11:39:23,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {20639#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {20639#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {20639#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {20639#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); {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {20639#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {20639#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); {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {20639#false} assume 12292 != #t~mem85;havoc #t~mem85; {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {20639#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {20639#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); {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {20639#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {20639#false} ~skip~0 := 0; {20639#false} is VALID [2022-04-15 11:39:23,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {20639#false} assume !false; {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {20639#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); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {20639#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {20639#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {20639#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {20639#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {20639#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {20639#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {20639#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {20639#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {20639#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {20639#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {20639#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {20639#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {20639#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {20639#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {20639#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {20639#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {20639#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 50: Hoare triple {20639#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {20639#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {20639#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {20639#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {20639#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {20639#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {20639#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {20639#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {20639#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 59: Hoare triple {20639#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {20639#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {20639#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {20639#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {20639#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {20639#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 65: Hoare triple {20639#false} assume 8672 == #t~mem79;havoc #t~mem79; {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {20639#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 67: Hoare triple {20639#false} assume 3 == ~blastFlag~0; {20639#false} is VALID [2022-04-15 11:39:23,960 INFO L290 TraceCheckUtils]: 68: Hoare triple {20639#false} assume !false; {20639#false} is VALID [2022-04-15 11:39:23,961 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-15 11:39:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:23,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573049077] [2022-04-15 11:39:23,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573049077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:23,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:23,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:23,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:23,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930433637] [2022-04-15 11:39:23,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930433637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:23,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:23,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622653827] [2022-04-15 11:39:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:23,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:23,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:23,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:24,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:24,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:24,017 INFO L87 Difference]: Start difference. First operand 287 states and 429 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:26,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:28,565 INFO L93 Difference]: Finished difference Result 443 states and 659 transitions. [2022-04-15 11:39:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:28,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-15 11:39:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-15 11:39:28,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 425 transitions. [2022-04-15 11:39:28,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:28,831 INFO L225 Difference]: With dead ends: 443 [2022-04-15 11:39:28,831 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 11:39:28,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:39:28,832 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 21 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:28,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 11:39:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 11:39:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 287. [2022-04-15 11:39:28,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:28,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 287 states, 282 states have (on average 1.50354609929078) internal successors, (424), 282 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:28,841 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 287 states, 282 states have (on average 1.50354609929078) internal successors, (424), 282 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:28,841 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 287 states, 282 states have (on average 1.50354609929078) internal successors, (424), 282 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:28,845 INFO L93 Difference]: Finished difference Result 303 states and 447 transitions. [2022-04-15 11:39:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 447 transitions. [2022-04-15 11:39:28,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:28,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:28,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.50354609929078) internal successors, (424), 282 states have internal predecessors, (424), 3 states have call successors, (3), 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 303 states. [2022-04-15 11:39:28,846 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.50354609929078) internal successors, (424), 282 states have internal predecessors, (424), 3 states have call successors, (3), 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 303 states. [2022-04-15 11:39:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:28,850 INFO L93 Difference]: Finished difference Result 303 states and 447 transitions. [2022-04-15 11:39:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 447 transitions. [2022-04-15 11:39:28,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:28,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:28,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:28,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.50354609929078) internal successors, (424), 282 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 428 transitions. [2022-04-15 11:39:28,855 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 428 transitions. Word has length 69 [2022-04-15 11:39:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:28,855 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 428 transitions. [2022-04-15 11:39:28,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:28,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 428 transitions. [2022-04-15 11:39:31,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 427 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 428 transitions. [2022-04-15 11:39:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:39:31,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:31,297 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:31,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:39:31,297 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 1 times [2022-04-15 11:39:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:31,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971670430] [2022-04-15 11:39:31,541 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-15 11:39:31,541 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:39:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1319751039, now seen corresponding path program 1 times [2022-04-15 11:39:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:31,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836718729] [2022-04-15 11:39:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:31,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {22722#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22716#true} is VALID [2022-04-15 11:39:31,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {22716#true} assume true; {22716#true} is VALID [2022-04-15 11:39:31,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22716#true} {22716#true} #661#return; {22716#true} is VALID [2022-04-15 11:39:31,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {22716#true} call ULTIMATE.init(); {22722#(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-15 11:39:31,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {22722#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22716#true} is VALID [2022-04-15 11:39:31,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {22716#true} assume true; {22716#true} is VALID [2022-04-15 11:39:31,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22716#true} {22716#true} #661#return; {22716#true} is VALID [2022-04-15 11:39:31,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {22716#true} call #t~ret161 := main(); {22716#true} is VALID [2022-04-15 11:39:31,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {22716#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {22716#true} is VALID [2022-04-15 11:39:31,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {22716#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22716#true} is VALID [2022-04-15 11:39:31,677 INFO L272 TraceCheckUtils]: 7: Hoare triple {22716#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22716#true} is VALID [2022-04-15 11:39:31,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {22716#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;~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); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 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; {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 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; {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} [679] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem47_60| |v_ssl3_accept_#t~mem47_58|)) (.cse1 (= v_ssl3_accept_~skip~0_49 v_ssl3_accept_~skip~0_48)) (.cse2 (= |v_ssl3_accept_#t~mem50_26| |v_ssl3_accept_#t~mem50_24|)) (.cse3 (= |v_ssl3_accept_#t~mem46_39| |v_ssl3_accept_#t~mem46_38|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_35| |v_ssl3_accept_#t~mem88.base_34|)) (.cse5 (= |v_ssl3_accept_#t~mem85_58| |v_ssl3_accept_#t~mem85_56|)) (.cse6 (= |v_ssl3_accept_#t~mem82_58| |v_ssl3_accept_#t~mem82_56|)) (.cse7 (= |v_ssl3_accept_#t~mem151_54| |v_ssl3_accept_#t~mem151_52|)) (.cse8 (= |v_ssl3_accept_#t~mem83.offset_58| |v_ssl3_accept_#t~mem83.offset_56|)) (.cse9 (= |v_ssl3_accept_#t~mem51_10| |v_ssl3_accept_#t~mem51_8|)) (.cse10 (= |v_ssl3_accept_#t~mem49_42| |v_ssl3_accept_#t~mem49_40|)) (.cse11 (= |v_ssl3_accept_#t~mem83.base_58| |v_ssl3_accept_#t~mem83.base_56|)) (.cse12 (= v_ssl3_accept_~state~0_41 v_ssl3_accept_~state~0_40)) (.cse13 (= |v_ssl3_accept_#t~mem150.offset_52| |v_ssl3_accept_#t~mem150.offset_50|)) (.cse14 (= |v_ssl3_accept_#t~mem48_58| |v_ssl3_accept_#t~mem48_56|)) (.cse15 (= |v_ssl3_accept_#t~mem150.base_52| |v_ssl3_accept_#t~mem150.base_50|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.offset_35| |v_ssl3_accept_#t~mem88.offset_34|) (= |v_ssl3_accept_#t~mem89_35| |v_ssl3_accept_#t~mem89_34|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_#memory_$Pointer$.base_439| |v_#memory_$Pointer$.base_433|) .cse6 (= |v_#memory_$Pointer$.offset_439| |v_#memory_$Pointer$.offset_433|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_403| |v_#memory_int_398|) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= |v_#memory_$Pointer$.offset_433| |v_#memory_$Pointer$.offset_439|) .cse4 (= |v_ssl3_accept_#t~mem89_34| |v_ssl3_accept_#t~mem89_35|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_398| |v_#memory_int_403|) (= |v_ssl3_accept_#t~mem88.offset_34| |v_ssl3_accept_#t~mem88.offset_35|) .cse12 (= |v_#memory_$Pointer$.base_433| |v_#memory_$Pointer$.base_439|) .cse13 .cse14 .cse15))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_58|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_439|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_58|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_58|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_54|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_52|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_26|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_35|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_58|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_42|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_58|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_52|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_60|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_39|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_49, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_35|, #memory_int=|v_#memory_int_403|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_439|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_41} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_56|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_433|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_56|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_56|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_52|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_8|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_50|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_34|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_56|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_40|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_56|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_50|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_58|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_38|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_48, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_34|, #memory_int=|v_#memory_int_398|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_34|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_433|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_40} 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~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, 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] {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} [678] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} 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); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {22721#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:31,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {22721#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {22717#false} is VALID [2022-04-15 11:39:31,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {22717#false} assume !false; {22717#false} is VALID [2022-04-15 11:39:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:39:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:31,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836718729] [2022-04-15 11:39:31,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836718729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:31,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:31,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:39:35,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971670430] [2022-04-15 11:39:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971670430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:35,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:35,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:39:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42664559] [2022-04-15 11:39:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:35,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:35,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:35,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:35,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:39:35,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:39:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:39:35,384 INFO L87 Difference]: Start difference. First operand 287 states and 428 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:37,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:43,381 INFO L93 Difference]: Finished difference Result 432 states and 646 transitions. [2022-04-15 11:39:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:39:43,381 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 572 transitions. [2022-04-15 11:39:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 572 transitions. [2022-04-15 11:39:43,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 572 transitions. [2022-04-15 11:39:43,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:43,774 INFO L225 Difference]: With dead ends: 432 [2022-04-15 11:39:43,774 INFO L226 Difference]: Without dead ends: 299 [2022-04-15 11:39:43,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:39:43,775 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 133 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:43,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 1011 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 731 Invalid, 1 Unknown, 490 Unchecked, 3.8s Time] [2022-04-15 11:39:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-15 11:39:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 289. [2022-04-15 11:39:43,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:43,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 289 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 284 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,784 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 289 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 284 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,784 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 289 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 284 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:43,788 INFO L93 Difference]: Finished difference Result 299 states and 443 transitions. [2022-04-15 11:39:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 443 transitions. [2022-04-15 11:39:43,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:43,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:43,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 284 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-15 11:39:43,789 INFO L87 Difference]: Start difference. First operand has 289 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 284 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-15 11:39:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:43,793 INFO L93 Difference]: Finished difference Result 299 states and 443 transitions. [2022-04-15 11:39:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 443 transitions. [2022-04-15 11:39:43,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:43,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:43,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:43,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 284 states have internal predecessors, (427), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 431 transitions. [2022-04-15 11:39:43,798 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 431 transitions. Word has length 69 [2022-04-15 11:39:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:43,798 INFO L478 AbstractCegarLoop]: Abstraction has 289 states and 431 transitions. [2022-04-15 11:39:43,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 289 states and 431 transitions. [2022-04-15 11:39:46,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 430 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 431 transitions. [2022-04-15 11:39:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:39:46,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:46,407 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:46,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:39:46,407 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1838319324, now seen corresponding path program 1 times [2022-04-15 11:39:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:46,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57475741] [2022-04-15 11:39:46,720 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-15 11:39:46,720 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:39:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash 100489793, now seen corresponding path program 1 times [2022-04-15 11:39:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:46,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338061459] [2022-04-15 11:39:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:46,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {24783#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24777#true} is VALID [2022-04-15 11:39:46,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {24777#true} assume true; {24777#true} is VALID [2022-04-15 11:39:46,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24777#true} {24777#true} #661#return; {24777#true} is VALID [2022-04-15 11:39:46,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {24777#true} call ULTIMATE.init(); {24783#(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-15 11:39:46,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {24783#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24777#true} is VALID [2022-04-15 11:39:46,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {24777#true} assume true; {24777#true} is VALID [2022-04-15 11:39:46,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24777#true} {24777#true} #661#return; {24777#true} is VALID [2022-04-15 11:39:46,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {24777#true} call #t~ret161 := main(); {24777#true} is VALID [2022-04-15 11:39:46,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {24777#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {24777#true} is VALID [2022-04-15 11:39:46,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {24777#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24777#true} is VALID [2022-04-15 11:39:46,856 INFO L272 TraceCheckUtils]: 7: Hoare triple {24777#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24777#true} is VALID [2022-04-15 11:39:46,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {24777#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;~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); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 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; {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 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; {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} [681] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem89_40| |v_ssl3_accept_#t~mem89_39|)) (.cse1 (= |v_ssl3_accept_#t~mem51_17| |v_ssl3_accept_#t~mem51_15|)) (.cse2 (= |v_#memory_int_422| |v_#memory_int_417|)) (.cse3 (= |v_ssl3_accept_#t~mem150.offset_58| |v_ssl3_accept_#t~mem150.offset_56|)) (.cse4 (= |v_ssl3_accept_#t~mem83.base_65| |v_ssl3_accept_#t~mem83.base_63|)) (.cse5 (= |v_ssl3_accept_#t~mem50_33| |v_ssl3_accept_#t~mem50_31|)) (.cse6 (= |v_ssl3_accept_#t~mem47_67| |v_ssl3_accept_#t~mem47_65|)) (.cse7 (= |v_ssl3_accept_#t~mem49_49| |v_ssl3_accept_#t~mem49_47|)) (.cse8 (= |v_ssl3_accept_#t~mem48_65| |v_ssl3_accept_#t~mem48_63|)) (.cse9 (= |v_ssl3_accept_#t~mem83.offset_65| |v_ssl3_accept_#t~mem83.offset_63|)) (.cse10 (= v_ssl3_accept_~state~0_46 v_ssl3_accept_~state~0_45)) (.cse11 (= |v_ssl3_accept_#t~mem150.base_58| |v_ssl3_accept_#t~mem150.base_56|)) (.cse12 (= v_ssl3_accept_~skip~0_54 v_ssl3_accept_~skip~0_53)) (.cse13 (= |v_ssl3_accept_#t~mem46_44| |v_ssl3_accept_#t~mem46_43|)) (.cse14 (= |v_ssl3_accept_#t~mem82_65| |v_ssl3_accept_#t~mem82_63|))) (or (and (= |v_#memory_$Pointer$.offset_453| |v_#memory_$Pointer$.offset_459|) (= |v_ssl3_accept_#t~mem88.offset_39| |v_ssl3_accept_#t~mem88.offset_40|) .cse0 (= |v_ssl3_accept_#t~mem85_63| |v_ssl3_accept_#t~mem85_65|) .cse1 (= |v_ssl3_accept_#t~mem88.base_39| |v_ssl3_accept_#t~mem88.base_40|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem151_58| |v_ssl3_accept_#t~mem151_60|) .cse12 .cse13 .cse14 (= |v_#memory_$Pointer$.base_453| |v_#memory_$Pointer$.base_459|)) (and (= |v_ssl3_accept_#t~mem85_65| |v_ssl3_accept_#t~mem85_63|) (= |v_ssl3_accept_#t~mem151_60| |v_ssl3_accept_#t~mem151_58|) (= |v_ssl3_accept_#t~mem88.base_40| |v_ssl3_accept_#t~mem88.base_39|) .cse0 (= |v_#memory_$Pointer$.offset_459| |v_#memory_$Pointer$.offset_453|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem88.offset_40| |v_ssl3_accept_#t~mem88.offset_39|) .cse12 (= |v_#memory_$Pointer$.base_459| |v_#memory_$Pointer$.base_453|) .cse13 .cse14))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_65|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_459|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_65|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_65|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_60|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_17|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_58|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_33|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_40|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_65|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_49|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_65|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_58|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_67|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_44|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_54, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_40|, #memory_int=|v_#memory_int_422|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_459|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_46} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_63|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_453|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_63|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_63|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_58|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_15|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_56|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_31|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_39|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_63|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_47|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_63|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_56|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_65|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_43|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_53, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_39|, #memory_int=|v_#memory_int_417|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_39|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_453|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_45} 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~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, 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] {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} [680] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} 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); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume 8672 == #t~mem79;havoc #t~mem79; {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {24782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:39:46,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {24782#(= ssl3_accept_~blastFlag~0 0)} assume 3 == ~blastFlag~0; {24778#false} is VALID [2022-04-15 11:39:46,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {24778#false} assume !false; {24778#false} is VALID [2022-04-15 11:39:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:39:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:46,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338061459] [2022-04-15 11:39:46,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338061459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:46,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:46,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:39:50,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:50,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57475741] [2022-04-15 11:39:50,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57475741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:50,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:50,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:39:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350607560] [2022-04-15 11:39:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:50,864 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:39:50,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:50,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:50,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:50,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:39:50,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:39:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:39:50,936 INFO L87 Difference]: Start difference. First operand 289 states and 431 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:52,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:00,784 INFO L93 Difference]: Finished difference Result 572 states and 859 transitions. [2022-04-15 11:40:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:40:00,784 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:40:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 595 transitions. [2022-04-15 11:40:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 595 transitions. [2022-04-15 11:40:00,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 595 transitions. [2022-04-15 11:40:01,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:01,214 INFO L225 Difference]: With dead ends: 572 [2022-04-15 11:40:01,214 INFO L226 Difference]: Without dead ends: 439 [2022-04-15 11:40:01,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-15 11:40:01,215 INFO L913 BasicCegarLoop]: 180 mSDtfsCounter, 155 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:01,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 871 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 864 Invalid, 1 Unknown, 44 Unchecked, 4.6s Time] [2022-04-15 11:40:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-04-15 11:40:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 415. [2022-04-15 11:40:01,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:01,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 439 states. Second operand has 415 states, 410 states have (on average 1.5048780487804878) internal successors, (617), 410 states have internal predecessors, (617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:01,228 INFO L74 IsIncluded]: Start isIncluded. First operand 439 states. Second operand has 415 states, 410 states have (on average 1.5048780487804878) internal successors, (617), 410 states have internal predecessors, (617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:01,228 INFO L87 Difference]: Start difference. First operand 439 states. Second operand has 415 states, 410 states have (on average 1.5048780487804878) internal successors, (617), 410 states have internal predecessors, (617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:01,235 INFO L93 Difference]: Finished difference Result 439 states and 651 transitions. [2022-04-15 11:40:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 651 transitions. [2022-04-15 11:40:01,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:01,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:01,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 410 states have (on average 1.5048780487804878) internal successors, (617), 410 states have internal predecessors, (617), 3 states have call successors, (3), 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 439 states. [2022-04-15 11:40:01,236 INFO L87 Difference]: Start difference. First operand has 415 states, 410 states have (on average 1.5048780487804878) internal successors, (617), 410 states have internal predecessors, (617), 3 states have call successors, (3), 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 439 states. [2022-04-15 11:40:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:01,243 INFO L93 Difference]: Finished difference Result 439 states and 651 transitions. [2022-04-15 11:40:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 651 transitions. [2022-04-15 11:40:01,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:01,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:01,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:01,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.5048780487804878) internal successors, (617), 410 states have internal predecessors, (617), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 621 transitions. [2022-04-15 11:40:01,252 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 621 transitions. Word has length 69 [2022-04-15 11:40:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:01,252 INFO L478 AbstractCegarLoop]: Abstraction has 415 states and 621 transitions. [2022-04-15 11:40:01,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:01,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 415 states and 621 transitions. [2022-04-15 11:40:04,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 620 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 621 transitions. [2022-04-15 11:40:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:40:04,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:04,198 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:40:04,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:40:04,199 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 1 times [2022-04-15 11:40:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:04,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999797185] [2022-04-15 11:40:04,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:40:04,251 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:40:04,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 2 times [2022-04-15 11:40:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:04,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991703247] [2022-04-15 11:40:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:04,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {27657#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27650#true} is VALID [2022-04-15 11:40:04,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-15 11:40:04,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27650#true} {27650#true} #661#return; {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {27650#true} call ULTIMATE.init(); {27657#(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-15 11:40:04,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {27657#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {27650#true} assume true; {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27650#true} {27650#true} #661#return; {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {27650#true} call #t~ret161 := main(); {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {27650#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {27650#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L272 TraceCheckUtils]: 7: Hoare triple {27650#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {27650#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;~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); {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {27650#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; {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {27650#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; {27650#true} is VALID [2022-04-15 11:40:04,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {27650#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {27650#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {27650#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {27650#true} assume !false; {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {27650#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); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {27650#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {27650#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {27650#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {27650#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {27650#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {27650#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {27650#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {27650#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {27650#true} assume 8464 == #t~mem55;havoc #t~mem55; {27650#true} is VALID [2022-04-15 11:40:04,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {27650#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; {27650#true} is VALID [2022-04-15 11:40:04,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {27650#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27650#true} is VALID [2022-04-15 11:40:04,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {27650#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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {27655#(= 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; {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {27655#(= 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); {27655#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:04,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {27655#(= 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); {27656#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {27656#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {27651#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {27651#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {27651#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {27651#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {27651#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {27651#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {27651#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {27651#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {27651#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {27651#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {27651#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {27651#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {27651#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {27651#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {27651#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {27651#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {27651#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {27651#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {27651#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {27651#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {27651#false} assume 8672 == #t~mem79;havoc #t~mem79; {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {27651#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {27651#false} assume 3 == ~blastFlag~0; {27651#false} is VALID [2022-04-15 11:40:04,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {27651#false} assume !false; {27651#false} is VALID [2022-04-15 11:40:04,452 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-15 11:40:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991703247] [2022-04-15 11:40:04,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991703247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:04,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:04,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:04,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:04,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999797185] [2022-04-15 11:40:04,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999797185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:04,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:04,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920433412] [2022-04-15 11:40:04,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:40:04,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:04,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:04,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:04,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:04,502 INFO L87 Difference]: Start difference. First operand 415 states and 621 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:06,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:11,687 INFO L93 Difference]: Finished difference Result 591 states and 889 transitions. [2022-04-15 11:40:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 11:40:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-15 11:40:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-15 11:40:11,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-15 11:40:11,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:11,991 INFO L225 Difference]: With dead ends: 591 [2022-04-15 11:40:11,992 INFO L226 Difference]: Without dead ends: 458 [2022-04-15 11:40:11,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:11,992 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 35 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:11,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 567 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 436 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 11:40:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-04-15 11:40:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 437. [2022-04-15 11:40:12,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:12,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand has 437 states, 432 states have (on average 1.5138888888888888) internal successors, (654), 432 states have internal predecessors, (654), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:12,006 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand has 437 states, 432 states have (on average 1.5138888888888888) internal successors, (654), 432 states have internal predecessors, (654), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:12,006 INFO L87 Difference]: Start difference. First operand 458 states. Second operand has 437 states, 432 states have (on average 1.5138888888888888) internal successors, (654), 432 states have internal predecessors, (654), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:12,013 INFO L93 Difference]: Finished difference Result 458 states and 686 transitions. [2022-04-15 11:40:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 686 transitions. [2022-04-15 11:40:12,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:12,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:12,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 437 states, 432 states have (on average 1.5138888888888888) internal successors, (654), 432 states have internal predecessors, (654), 3 states have call successors, (3), 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 458 states. [2022-04-15 11:40:12,015 INFO L87 Difference]: Start difference. First operand has 437 states, 432 states have (on average 1.5138888888888888) internal successors, (654), 432 states have internal predecessors, (654), 3 states have call successors, (3), 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 458 states. [2022-04-15 11:40:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:12,022 INFO L93 Difference]: Finished difference Result 458 states and 686 transitions. [2022-04-15 11:40:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 686 transitions. [2022-04-15 11:40:12,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:12,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:12,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:12,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 432 states have (on average 1.5138888888888888) internal successors, (654), 432 states have internal predecessors, (654), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 658 transitions. [2022-04-15 11:40:12,038 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 658 transitions. Word has length 69 [2022-04-15 11:40:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:12,038 INFO L478 AbstractCegarLoop]: Abstraction has 437 states and 658 transitions. [2022-04-15 11:40:12,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:12,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 437 states and 658 transitions. [2022-04-15 11:40:14,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 658 edges. 657 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 658 transitions. [2022-04-15 11:40:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 11:40:14,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:14,879 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:40:14,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:40:14,879 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1735556409, now seen corresponding path program 1 times [2022-04-15 11:40:14,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:14,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127905401] [2022-04-15 11:40:14,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:40:14,920 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:40:14,920 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1735556409, now seen corresponding path program 2 times [2022-04-15 11:40:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:14,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461329488] [2022-04-15 11:40:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:15,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {30641#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30634#true} is VALID [2022-04-15 11:40:15,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {30634#true} assume true; {30634#true} is VALID [2022-04-15 11:40:15,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30634#true} {30634#true} #661#return; {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {30634#true} call ULTIMATE.init(); {30641#(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-15 11:40:15,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {30641#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {30634#true} assume true; {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30634#true} {30634#true} #661#return; {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {30634#true} call #t~ret161 := main(); {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {30634#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {30634#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L272 TraceCheckUtils]: 7: Hoare triple {30634#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {30634#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;~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); {30634#true} is VALID [2022-04-15 11:40:15,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {30634#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; {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {30634#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; {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {30634#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {30634#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {30634#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {30634#true} assume !false; {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {30634#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); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {30634#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {30634#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {30634#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {30634#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {30634#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {30634#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {30634#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {30634#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30634#true} is VALID [2022-04-15 11:40:15,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {30634#true} assume 8464 == #t~mem55;havoc #t~mem55; {30634#true} is VALID [2022-04-15 11:40:15,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {30634#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; {30634#true} is VALID [2022-04-15 11:40:15,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {30634#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30634#true} is VALID [2022-04-15 11:40:15,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {30634#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); {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {30639#(not (= 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); {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {30639#(not (= 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; {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:15,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {30639#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30640#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {30640#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {30635#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; {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {30635#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); {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {30635#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); {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {30635#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {30635#false} ~skip~0 := 0; {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {30635#false} assume !false; {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {30635#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); {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {30635#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {30635#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {30635#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {30635#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {30635#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {30635#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {30635#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {30635#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {30635#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {30635#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {30635#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {30635#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {30635#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {30635#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {30635#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {30635#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {30635#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {30635#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {30635#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {30635#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {30635#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {30635#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {30635#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {30635#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {30635#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {30635#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {30635#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {30635#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {30635#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,165 INFO L290 TraceCheckUtils]: 75: Hoare triple {30635#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,165 INFO L290 TraceCheckUtils]: 76: Hoare triple {30635#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,165 INFO L290 TraceCheckUtils]: 77: Hoare triple {30635#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {30635#false} is VALID [2022-04-15 11:40:15,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {30635#false} assume 8672 == #t~mem79;havoc #t~mem79; {30635#false} is VALID [2022-04-15 11:40:15,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {30635#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30635#false} is VALID [2022-04-15 11:40:15,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {30635#false} assume 3 == ~blastFlag~0; {30635#false} is VALID [2022-04-15 11:40:15,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {30635#false} assume !false; {30635#false} is VALID [2022-04-15 11:40:15,166 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-15 11:40:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:15,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461329488] [2022-04-15 11:40:15,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461329488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:15,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:15,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:15,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:15,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127905401] [2022-04-15 11:40:15,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127905401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:15,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:15,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:15,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880478494] [2022-04-15 11:40:15,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:40:15,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:15,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:15,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:15,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:15,228 INFO L87 Difference]: Start difference. First operand 437 states and 658 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:17,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:22,162 INFO L93 Difference]: Finished difference Result 1167 states and 1774 transitions. [2022-04-15 11:40:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:22,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 11:40:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-15 11:40:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-15 11:40:22,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-15 11:40:22,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:22,585 INFO L225 Difference]: With dead ends: 1167 [2022-04-15 11:40:22,585 INFO L226 Difference]: Without dead ends: 756 [2022-04-15 11:40:22,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:22,586 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:22,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 318 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:40:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-04-15 11:40:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 474. [2022-04-15 11:40:22,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:22,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 756 states. Second operand has 474 states, 469 states have (on average 1.5181236673773988) internal successors, (712), 469 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:22,604 INFO L74 IsIncluded]: Start isIncluded. First operand 756 states. Second operand has 474 states, 469 states have (on average 1.5181236673773988) internal successors, (712), 469 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:22,605 INFO L87 Difference]: Start difference. First operand 756 states. Second operand has 474 states, 469 states have (on average 1.5181236673773988) internal successors, (712), 469 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:22,620 INFO L93 Difference]: Finished difference Result 756 states and 1145 transitions. [2022-04-15 11:40:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1145 transitions. [2022-04-15 11:40:22,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:22,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:22,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 474 states, 469 states have (on average 1.5181236673773988) internal successors, (712), 469 states have internal predecessors, (712), 3 states have call successors, (3), 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 756 states. [2022-04-15 11:40:22,622 INFO L87 Difference]: Start difference. First operand has 474 states, 469 states have (on average 1.5181236673773988) internal successors, (712), 469 states have internal predecessors, (712), 3 states have call successors, (3), 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 756 states. [2022-04-15 11:40:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:22,638 INFO L93 Difference]: Finished difference Result 756 states and 1145 transitions. [2022-04-15 11:40:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1145 transitions. [2022-04-15 11:40:22,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:22,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:22,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:22,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 469 states have (on average 1.5181236673773988) internal successors, (712), 469 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 716 transitions. [2022-04-15 11:40:22,649 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 716 transitions. Word has length 82 [2022-04-15 11:40:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:22,649 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 716 transitions. [2022-04-15 11:40:22,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:22,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 474 states and 716 transitions. [2022-04-15 11:40:25,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 716 edges. 715 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 716 transitions. [2022-04-15 11:40:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 11:40:25,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:25,616 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:40:25,616 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:40:25,616 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash 791314165, now seen corresponding path program 1 times [2022-04-15 11:40:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:25,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8780997] [2022-04-15 11:40:25,941 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-15 11:40:25,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:40:25,942 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:40:25,943 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:195) 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:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 11:40:25,945 INFO L158 Benchmark]: Toolchain (without parser) took 148646.30ms. Allocated memory was 183.5MB in the beginning and 273.7MB in the end (delta: 90.2MB). Free memory was 129.1MB in the beginning and 215.2MB in the end (delta: -86.1MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. [2022-04-15 11:40:25,945 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:40:25,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.61ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 128.9MB in the beginning and 180.2MB in the end (delta: -51.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 11:40:25,946 INFO L158 Benchmark]: Boogie Preprocessor took 126.65ms. Allocated memory is still 227.5MB. Free memory was 179.7MB in the beginning and 170.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 11:40:25,946 INFO L158 Benchmark]: RCFGBuilder took 2988.40ms. Allocated memory is still 227.5MB. Free memory was 169.7MB in the beginning and 169.7MB in the end (delta: -5.6kB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2022-04-15 11:40:25,946 INFO L158 Benchmark]: TraceAbstraction took 145074.41ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 169.2MB in the beginning and 215.2MB in the end (delta: -46.0MB). Peak memory consumption was 168.4kB. Max. memory is 8.0GB. [2022-04-15 11:40:25,947 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.61ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 128.9MB in the beginning and 180.2MB in the end (delta: -51.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 126.65ms. Allocated memory is still 227.5MB. Free memory was 179.7MB in the beginning and 170.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2988.40ms. Allocated memory is still 227.5MB. Free memory was 169.7MB in the beginning and 169.7MB in the end (delta: -5.6kB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 145074.41ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 169.2MB in the beginning and 215.2MB in the end (delta: -46.0MB). Peak memory consumption was 168.4kB. 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-15 11:40:26,020 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...