/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:17:22,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:17:22,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:17:22,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:17:22,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:17:22,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:17:22,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:17:22,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:17:22,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:17:22,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:17:22,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:17:22,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:17:22,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:17:22,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:17:22,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:17:22,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:17:22,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:17:22,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:17:22,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:17:22,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:17:22,574 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:17:22,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:17:22,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:17:22,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:17:22,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:17:22,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:17:22,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:17:22,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:17:22,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:17:22,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:17:22,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:17:22,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:17:22,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:17:22,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:17:22,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:17:22,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:17:22,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:17:22,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:17:22,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:17:22,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:17:22,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:17:22,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:17:22,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:17:22,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:17:22,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:17:22,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:17:22,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:17:22,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:17:22,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:17:22,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:17:22,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:17:22,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:17:22,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:17:22,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:17:22,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:17:22,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:17:22,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:17:22,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:17:22,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:17:22,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:17:22,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:17:22,618 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:17:22,619 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:17:22,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:17:22,619 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:17:22,619 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-28 15:17:22,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:17:22,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:17:22,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:17:22,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:17:22,855 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:17:22,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c [2022-04-28 15:17:22,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3e1a043/6353a6348f75487ba4004ac3e2d22d96/FLAG01a5603f4 [2022-04-28 15:17:23,400 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:17:23,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.04.i.cil.c [2022-04-28 15:17:23,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3e1a043/6353a6348f75487ba4004ac3e2d22d96/FLAG01a5603f4 [2022-04-28 15:17:23,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3e1a043/6353a6348f75487ba4004ac3e2d22d96 [2022-04-28 15:17:23,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:17:23,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:17:23,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:17:23,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:17:23,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:17:23,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:17:23" (1/1) ... [2022-04-28 15:17:23,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d32fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:23, skipping insertion in model container [2022-04-28 15:17:23,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:17:23" (1/1) ... [2022-04-28 15:17:23,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:17:24,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:17:24,361 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.04.i.cil.c[72500,72513] [2022-04-28 15:17:24,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:17:24,378 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:17:24,462 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.04.i.cil.c[72500,72513] [2022-04-28 15:17:24,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:17:24,482 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:17:24,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24 WrapperNode [2022-04-28 15:17:24,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:17:24,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:17:24,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:17:24,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:17:24,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:17:24,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:17:24,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:17:24,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:17:24,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (1/1) ... [2022-04-28 15:17:24,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:17:24,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:17:24,673 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-28 15:17:24,676 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-28 15:17:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:17:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:17:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:17:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:17:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:17:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:17:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:17:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:17:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:17:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:17:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:17:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:17:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:17:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:17:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:17:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:17:24,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:17:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:17:24,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:17:24,894 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:17:24,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:17:26,370 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:17:27,003 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:17:27,004 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:17:27,023 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:17:27,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:17:27,034 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:17:27,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:17:27 BoogieIcfgContainer [2022-04-28 15:17:27,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:17:27,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:17:27,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:17:27,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:17:27,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:17:23" (1/3) ... [2022-04-28 15:17:27,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@939d22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:17:27, skipping insertion in model container [2022-04-28 15:17:27,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:17:24" (2/3) ... [2022-04-28 15:17:27,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@939d22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:17:27, skipping insertion in model container [2022-04-28 15:17:27,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:17:27" (3/3) ... [2022-04-28 15:17:27,049 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2022-04-28 15:17:27,059 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:17:27,059 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:17:27,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:17:27,134 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@537bdc4b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c811b4c [2022-04-28 15:17:27,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:17:27,147 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-28 15:17:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 15:17:27,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:27,159 INFO L195 NwaCegarLoop]: 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-28 15:17:27,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 1 times [2022-04-28 15:17:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:27,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813276663] [2022-04-28 15:17:27,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:17:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 2 times [2022-04-28 15:17:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:27,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426501280] [2022-04-28 15:17:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:27,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:27,769 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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-28 15:17:27,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 15:17:27,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-28 15:17:27,771 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-28 15:17:27,772 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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-28 15:17:27,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 15:17:27,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-28 15:17:27,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-28 15:17:27,773 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(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {156#true} is VALID [2022-04-28 15:17:27,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {156#true} is VALID [2022-04-28 15:17:27,774 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-28 15:17:27,780 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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~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 72)))} is VALID [2022-04-28 15:17:27,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:27,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {162#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 15:17:27,794 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, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {157#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {157#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {157#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {157#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {157#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {157#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {157#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {157#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {157#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {157#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {157#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {157#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {157#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {157#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {157#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {157#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {157#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {157#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {157#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {157#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {157#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {157#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {157#false} is VALID [2022-04-28 15:17:27,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-28 15:17:27,802 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-28 15:17:27,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 4 == ~blastFlag~0; {157#false} is VALID [2022-04-28 15:17:27,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 15:17:27,803 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-28 15:17:27,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426501280] [2022-04-28 15:17:27,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426501280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:27,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:27,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:27,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:27,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813276663] [2022-04-28 15:17:27,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813276663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:27,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:27,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:27,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589501531] [2022-04-28 15:17:27,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:27,821 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-28 15:17:27,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:27,828 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-28 15:17:27,944 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-28 15:17:27,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:27,968 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-28 15:17:31,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:33,708 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-28 15:17:35,734 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-28 15:17:37,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:17:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:39,194 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-28 15:17:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:39,195 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-28 15:17:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:39,196 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-28 15:17:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-28 15:17:39,236 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-28 15:17:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-28 15:17:39,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-28 15:17:39,697 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-28 15:17:39,720 INFO L225 Difference]: With dead ends: 324 [2022-04-28 15:17:39,720 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 15:17:39,726 INFO L412 NwaCegarLoop]: 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-28 15:17:39,731 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 34 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:39,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 577 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 402 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-04-28 15:17:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 15:17:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-28 15:17:39,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:39,777 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-28 15:17:39,778 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-28 15:17:39,779 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-28 15:17:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:39,788 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-28 15:17:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-28 15:17:39,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:39,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:39,791 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-28 15:17:39,792 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-28 15:17:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:39,803 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-28 15:17:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-28 15:17:39,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:39,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:39,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:39,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:39,805 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-28 15:17:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-28 15:17:39,811 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-28 15:17:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:39,812 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-28 15:17:39,812 INFO L496 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-28 15:17:39,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 224 transitions. [2022-04-28 15:17:40,006 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-28 15:17:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-28 15:17:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:17:40,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:40,009 INFO L195 NwaCegarLoop]: 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-28 15:17:40,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:17:40,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 1 times [2022-04-28 15:17:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:40,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436354369] [2022-04-28 15:17:40,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:40,037 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 2 times [2022-04-28 15:17:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:40,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110764931] [2022-04-28 15:17:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:40,216 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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-28 15:17:40,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 15:17:40,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-28 15:17:40,218 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-28 15:17:40,218 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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-28 15:17:40,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {1442#true} assume true; {1442#true} is VALID [2022-04-28 15:17:40,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1442#true} {1442#true} #661#return; {1442#true} is VALID [2022-04-28 15:17:40,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {1442#true} call #t~ret161 := main(); {1442#true} is VALID [2022-04-28 15:17:40,219 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(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1442#true} is VALID [2022-04-28 15:17:40,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1442#true} is VALID [2022-04-28 15:17:40,219 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-28 15:17:40,221 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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~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 72)))} is VALID [2022-04-28 15:17:40,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:40,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {1447#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1448#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-28 15:17:40,229 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-28 15:17:40,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {1443#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {1443#false} is VALID [2022-04-28 15:17:40,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {1443#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {1443#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,230 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-28 15:17:40,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {1443#false} ~skip~0 := 0; {1443#false} is VALID [2022-04-28 15:17:40,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 15:17:40,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {1443#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {1443#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {1443#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {1443#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {1443#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {1443#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {1443#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {1443#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {1443#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {1443#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {1443#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {1443#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {1443#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {1443#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {1443#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {1443#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {1443#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {1443#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {1443#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {1443#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {1443#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {1443#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {1443#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {1443#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {1443#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {1443#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {1443#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {1443#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {1443#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {1443#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {1443#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {1443#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {1443#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {1443#false} is VALID [2022-04-28 15:17:40,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {1443#false} assume 8672 == #t~mem79;havoc #t~mem79; {1443#false} is VALID [2022-04-28 15:17:40,237 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-28 15:17:40,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {1443#false} assume 4 == ~blastFlag~0; {1443#false} is VALID [2022-04-28 15:17:40,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-28 15:17:40,238 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-28 15:17:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:40,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110764931] [2022-04-28 15:17:40,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110764931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:40,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:40,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:40,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436354369] [2022-04-28 15:17:40,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436354369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:40,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:40,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901736251] [2022-04-28 15:17:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:40,240 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-28 15:17:40,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:40,241 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-28 15:17:40,298 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-28 15:17:40,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:40,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:40,300 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-28 15:17:42,326 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-28 15:17:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:43,407 INFO L93 Difference]: Finished difference Result 287 states and 431 transitions. [2022-04-28 15:17:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:43,407 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-28 15:17:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:43,407 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-28 15:17:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-28 15:17:43,413 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-28 15:17:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-04-28 15:17:43,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 431 transitions. [2022-04-28 15:17:43,779 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-28 15:17:43,783 INFO L225 Difference]: With dead ends: 287 [2022-04-28 15:17:43,783 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 15:17:43,784 INFO L412 NwaCegarLoop]: 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-28 15:17:43,785 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:43,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 15:17:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-28 15:17:43,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:43,795 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-28 15:17:43,796 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-28 15:17:43,796 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-28 15:17:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:43,818 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:17:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:17:43,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:43,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:43,819 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-28 15:17:43,819 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-28 15:17:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:43,824 INFO L93 Difference]: Finished difference Result 165 states and 244 transitions. [2022-04-28 15:17:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-04-28 15:17:43,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:43,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:43,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:43,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:43,826 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-28 15:17:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2022-04-28 15:17:43,830 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 65 [2022-04-28 15:17:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:43,831 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2022-04-28 15:17:43,832 INFO L496 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-28 15:17:43,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 223 transitions. [2022-04-28 15:17:44,002 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-28 15:17:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2022-04-28 15:17:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:17:44,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:44,003 INFO L195 NwaCegarLoop]: 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-28 15:17:44,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:17:44,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 1 times [2022-04-28 15:17:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373929816] [2022-04-28 15:17:44,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:44,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 2 times [2022-04-28 15:17:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:44,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595887665] [2022-04-28 15:17:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:44,209 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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-28 15:17:44,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-28 15:17:44,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-28 15:17:44,212 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-28 15:17:44,212 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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-28 15:17:44,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2654#true} assume true; {2654#true} is VALID [2022-04-28 15:17:44,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2654#true} {2654#true} #661#return; {2654#true} is VALID [2022-04-28 15:17:44,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {2654#true} call #t~ret161 := main(); {2654#true} is VALID [2022-04-28 15:17:44,213 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(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2654#true} is VALID [2022-04-28 15:17:44,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {2654#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {2654#true} is VALID [2022-04-28 15:17:44,213 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-28 15:17:44,215 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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:44,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:44,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:44,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:44,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:44,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:44,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {2659#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2660#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {2660#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {2655#false} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {2655#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {2655#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {2655#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2655#false} is VALID [2022-04-28 15:17:44,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {2655#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,223 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, 80 + ~s.offset, 8); {2655#false} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {2655#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {2655#false} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {2655#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,224 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, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {2655#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,224 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-28 15:17:44,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {2655#false} ~skip~0 := 0; {2655#false} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {2655#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {2655#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {2655#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {2655#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {2655#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {2655#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {2655#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {2655#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {2655#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {2655#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {2655#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {2655#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {2655#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {2655#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {2655#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {2655#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {2655#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {2655#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {2655#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {2655#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {2655#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {2655#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {2655#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {2655#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {2655#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {2655#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {2655#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {2655#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {2655#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {2655#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {2655#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {2655#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {2655#false} is VALID [2022-04-28 15:17:44,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {2655#false} assume 8672 == #t~mem79;havoc #t~mem79; {2655#false} is VALID [2022-04-28 15:17:44,230 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-28 15:17:44,230 INFO L290 TraceCheckUtils]: 64: Hoare triple {2655#false} assume 4 == ~blastFlag~0; {2655#false} is VALID [2022-04-28 15:17:44,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {2655#false} assume !false; {2655#false} is VALID [2022-04-28 15:17:44,230 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-28 15:17:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:44,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595887665] [2022-04-28 15:17:44,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595887665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:44,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:44,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:44,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:44,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373929816] [2022-04-28 15:17:44,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373929816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:44,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:44,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:44,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328756373] [2022-04-28 15:17:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:44,233 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-28 15:17:44,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:44,233 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-28 15:17:44,288 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-28 15:17:44,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:44,289 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-28 15:17:46,314 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-28 15:17:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:47,329 INFO L93 Difference]: Finished difference Result 286 states and 429 transitions. [2022-04-28 15:17:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:47,329 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-28 15:17:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:47,329 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-28 15:17:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:17:47,334 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-28 15:17:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-28 15:17:47,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-28 15:17:47,620 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-28 15:17:47,623 INFO L225 Difference]: With dead ends: 286 [2022-04-28 15:17:47,623 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 15:17:47,624 INFO L412 NwaCegarLoop]: 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-28 15:17:47,625 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 28 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 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-28 15:17:47,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:17:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 15:17:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-28 15:17:47,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:47,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:47,634 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:47,635 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:47,639 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:17:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:17:47,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:47,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:47,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:47,641 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:47,645 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2022-04-28 15:17:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2022-04-28 15:17:47,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:47,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:47,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:47,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2022-04-28 15:17:47,650 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 66 [2022-04-28 15:17:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:47,650 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2022-04-28 15:17:47,650 INFO L496 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-28 15:17:47,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 222 transitions. [2022-04-28 15:17:47,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2022-04-28 15:17:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:17:47,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:47,816 INFO L195 NwaCegarLoop]: 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-28 15:17:47,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:17:47,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:47,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 1 times [2022-04-28 15:17:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:47,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452562597] [2022-04-28 15:17:47,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:17:47,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 2 times [2022-04-28 15:17:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:47,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466696082] [2022-04-28 15:17:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:48,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {3869#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {3862#true} is VALID [2022-04-28 15:17:48,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-28 15:17:48,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3862#true} {3862#true} #661#return; {3862#true} is VALID [2022-04-28 15:17:48,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {3862#true} call ULTIMATE.init(); {3869#(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-28 15:17:48,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {3862#true} is VALID [2022-04-28 15:17:48,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {3862#true} assume true; {3862#true} is VALID [2022-04-28 15:17:48,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3862#true} {3862#true} #661#return; {3862#true} is VALID [2022-04-28 15:17:48,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {3862#true} call #t~ret161 := main(); {3862#true} is VALID [2022-04-28 15:17:48,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {3862#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3862#true} is VALID [2022-04-28 15:17:48,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {3862#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3862#true} is VALID [2022-04-28 15:17:48,037 INFO L272 TraceCheckUtils]: 7: Hoare triple {3862#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3862#true} is VALID [2022-04-28 15:17:48,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:48,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {3867#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3868#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-28 15:17:48,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {3868#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {3863#false} is VALID [2022-04-28 15:17:48,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {3863#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {3863#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {3863#false} is VALID [2022-04-28 15:17:48,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {3863#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, 80 + ~s.offset, 8); {3863#false} is VALID [2022-04-28 15:17:48,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {3863#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {3863#false} is VALID [2022-04-28 15:17:48,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {3863#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {3863#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {3863#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {3863#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3863#false} is VALID [2022-04-28 15:17:48,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {3863#false} ~skip~0 := 0; {3863#false} is VALID [2022-04-28 15:17:48,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-28 15:17:48,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {3863#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {3863#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {3863#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {3863#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {3863#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {3863#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {3863#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {3863#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {3863#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {3863#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {3863#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {3863#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {3863#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {3863#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {3863#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {3863#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {3863#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {3863#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {3863#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {3863#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {3863#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {3863#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {3863#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {3863#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {3863#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {3863#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {3863#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {3863#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {3863#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {3863#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {3863#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {3863#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {3863#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {3863#false} is VALID [2022-04-28 15:17:48,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {3863#false} assume 8672 == #t~mem79;havoc #t~mem79; {3863#false} is VALID [2022-04-28 15:17:48,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {3863#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {3863#false} is VALID [2022-04-28 15:17:48,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {3863#false} assume 4 == ~blastFlag~0; {3863#false} is VALID [2022-04-28 15:17:48,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {3863#false} assume !false; {3863#false} is VALID [2022-04-28 15:17:48,063 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-28 15:17:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:48,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466696082] [2022-04-28 15:17:48,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466696082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:48,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:48,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:48,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:48,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452562597] [2022-04-28 15:17:48,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452562597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:48,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:48,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551066571] [2022-04-28 15:17:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:48,065 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-28 15:17:48,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:48,066 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-28 15:17:48,116 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-28 15:17:48,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:48,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:48,117 INFO L87 Difference]: Start difference. First operand 148 states and 222 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-28 15:17:50,149 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-28 15:17:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:51,168 INFO L93 Difference]: Finished difference Result 286 states and 428 transitions. [2022-04-28 15:17:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:51,185 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-28 15:17:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:51,186 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-28 15:17:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:17:51,203 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-28 15:17:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-28 15:17:51,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-28 15:17:51,533 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-28 15:17:51,535 INFO L225 Difference]: With dead ends: 286 [2022-04-28 15:17:51,535 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 15:17:51,536 INFO L412 NwaCegarLoop]: 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-28 15:17:51,536 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:51,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 15:17:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2022-04-28 15:17:51,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:51,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:51,545 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:51,545 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:51,549 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-28 15:17:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-28 15:17:51,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:51,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:51,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:51,550 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 15:17:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:51,554 INFO L93 Difference]: Finished difference Result 164 states and 241 transitions. [2022-04-28 15:17:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2022-04-28 15:17:51,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:51,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:51,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:51,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 143 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 221 transitions. [2022-04-28 15:17:51,558 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 221 transitions. Word has length 66 [2022-04-28 15:17:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:51,558 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 221 transitions. [2022-04-28 15:17:51,558 INFO L496 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-28 15:17:51,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 221 transitions. [2022-04-28 15:17:51,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 221 transitions. [2022-04-28 15:17:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:17:51,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:51,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:51,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:17:51,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:51,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 1 times [2022-04-28 15:17:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:51,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783255589] [2022-04-28 15:17:51,755 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:51,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 2 times [2022-04-28 15:17:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:51,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124900211] [2022-04-28 15:17:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:51,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {5077#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {5070#true} is VALID [2022-04-28 15:17:51,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-28 15:17:51,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5070#true} {5070#true} #661#return; {5070#true} is VALID [2022-04-28 15:17:51,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {5070#true} call ULTIMATE.init(); {5077#(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-28 15:17:51,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {5077#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {5070#true} is VALID [2022-04-28 15:17:51,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {5070#true} assume true; {5070#true} is VALID [2022-04-28 15:17:51,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5070#true} {5070#true} #661#return; {5070#true} is VALID [2022-04-28 15:17:51,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {5070#true} call #t~ret161 := main(); {5070#true} is VALID [2022-04-28 15:17:51,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {5070#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5070#true} is VALID [2022-04-28 15:17:51,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {5070#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5070#true} is VALID [2022-04-28 15:17:51,906 INFO L272 TraceCheckUtils]: 7: Hoare triple {5070#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5070#true} is VALID [2022-04-28 15:17:51,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {5070#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:51,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {5075#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5076#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-28 15:17:51,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {5076#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {5071#false} is VALID [2022-04-28 15:17:51,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {5071#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {5071#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {5071#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {5071#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {5071#false} ~skip~0 := 0; {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {5071#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {5071#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {5071#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {5071#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {5071#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {5071#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {5071#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {5071#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {5071#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {5071#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {5071#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {5071#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {5071#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {5071#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {5071#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {5071#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {5071#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {5071#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {5071#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {5071#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {5071#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {5071#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {5071#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {5071#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {5071#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {5071#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {5071#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {5071#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {5071#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {5071#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {5071#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {5071#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {5071#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {5071#false} assume 8672 == #t~mem79;havoc #t~mem79; {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {5071#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {5071#false} assume 4 == ~blastFlag~0; {5071#false} is VALID [2022-04-28 15:17:51,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {5071#false} assume !false; {5071#false} is VALID [2022-04-28 15:17:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:51,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124900211] [2022-04-28 15:17:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124900211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:51,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:51,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:51,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:51,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783255589] [2022-04-28 15:17:51,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783255589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:51,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:51,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055223130] [2022-04-28 15:17:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:51,930 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-28 15:17:51,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:51,930 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-28 15:17:51,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:51,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:51,983 INFO L87 Difference]: Start difference. First operand 148 states and 221 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-28 15:17:54,005 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-28 15:17:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:54,975 INFO L93 Difference]: Finished difference Result 284 states and 425 transitions. [2022-04-28 15:17:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:54,976 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-28 15:17:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:54,976 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-28 15:17:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-28 15:17:54,979 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-28 15:17:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2022-04-28 15:17:54,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 425 transitions. [2022-04-28 15:17:55,277 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-28 15:17:55,279 INFO L225 Difference]: With dead ends: 284 [2022-04-28 15:17:55,279 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 15:17:55,280 INFO L412 NwaCegarLoop]: 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-28 15:17:55,281 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 20 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:55,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 459 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 15:17:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2022-04-28 15:17:55,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:55,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:55,288 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:55,289 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:55,292 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-28 15:17:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-28 15:17:55,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:55,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:55,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 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 162 states. [2022-04-28 15:17:55,293 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 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 162 states. [2022-04-28 15:17:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:55,296 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2022-04-28 15:17:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2022-04-28 15:17:55,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:55,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:55,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:55,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 143 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2022-04-28 15:17:55,300 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 66 [2022-04-28 15:17:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:55,300 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2022-04-28 15:17:55,301 INFO L496 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-28 15:17:55,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 220 transitions. [2022-04-28 15:17:55,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2022-04-28 15:17:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:17:55,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:55,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:17:55,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:17:55,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 1 times [2022-04-28 15:17:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:55,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378557363] [2022-04-28 15:17:55,477 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:17:55,477 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 2 times [2022-04-28 15:17:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:55,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266612449] [2022-04-28 15:17:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:55,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {6270#true} is VALID [2022-04-28 15:17:55,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 15:17:55,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6270#true} {6270#true} #661#return; {6270#true} is VALID [2022-04-28 15:17:55,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6277#(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-28 15:17:55,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {6277#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {6270#true} is VALID [2022-04-28 15:17:55,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 15:17:55,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #661#return; {6270#true} is VALID [2022-04-28 15:17:55,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret161 := main(); {6270#true} is VALID [2022-04-28 15:17:55,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6270#true} is VALID [2022-04-28 15:17:55,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {6270#true} is VALID [2022-04-28 15:17:55,674 INFO L272 TraceCheckUtils]: 7: Hoare triple {6270#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6270#true} is VALID [2022-04-28 15:17:55,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {6270#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:55,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6276#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-28 15:17:55,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {6276#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {6271#false} is VALID [2022-04-28 15:17:55,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {6271#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {6271#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6271#false} is VALID [2022-04-28 15:17:55,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {6271#false} ~skip~0 := 0; {6271#false} is VALID [2022-04-28 15:17:55,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 15:17:55,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {6271#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {6271#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {6271#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {6271#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {6271#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {6271#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {6271#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {6271#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {6271#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {6271#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {6271#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {6271#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {6271#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {6271#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {6271#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {6271#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {6271#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {6271#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {6271#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {6271#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {6271#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {6271#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {6271#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {6271#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {6271#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {6271#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {6271#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {6271#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {6271#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {6271#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {6271#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {6271#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {6271#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {6271#false} is VALID [2022-04-28 15:17:55,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {6271#false} assume 8672 == #t~mem79;havoc #t~mem79; {6271#false} is VALID [2022-04-28 15:17:55,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {6271#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {6271#false} is VALID [2022-04-28 15:17:55,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {6271#false} assume 4 == ~blastFlag~0; {6271#false} is VALID [2022-04-28 15:17:55,692 INFO L290 TraceCheckUtils]: 65: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 15:17:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:17:55,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:55,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266612449] [2022-04-28 15:17:55,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266612449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:55,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:55,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:55,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:55,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378557363] [2022-04-28 15:17:55,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378557363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:55,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:55,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:55,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044197520] [2022-04-28 15:17:55,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:55,695 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-28 15:17:55,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:55,696 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-28 15:17:55,753 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-28 15:17:55,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:55,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:55,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:55,755 INFO L87 Difference]: Start difference. First operand 148 states and 220 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-28 15:17:57,781 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-28 15:17:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:58,692 INFO L93 Difference]: Finished difference Result 283 states and 423 transitions. [2022-04-28 15:17:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:17:58,692 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-28 15:17:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:17:58,692 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-28 15:17:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-28 15:17:58,695 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-28 15:17:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-28 15:17:58,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-28 15:17:59,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:59,009 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:17:59,009 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:17:59,009 INFO L412 NwaCegarLoop]: 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-28 15:17:59,010 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:17:59,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:17:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:17:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:17:59,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:17:59,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:59,023 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:59,024 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:59,029 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-28 15:17:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-28 15:17:59,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:59,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:59,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 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 161 states. [2022-04-28 15:17:59,030 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 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 161 states. [2022-04-28 15:17:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:17:59,033 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2022-04-28 15:17:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2022-04-28 15:17:59,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:17:59,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:17:59,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:17:59,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:17:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5034965034965035) internal successors, (215), 143 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:17:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions. [2022-04-28 15:17:59,037 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 66 [2022-04-28 15:17:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:17:59,037 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions. [2022-04-28 15:17:59,038 INFO L496 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-28 15:17:59,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 219 transitions. [2022-04-28 15:17:59,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:17:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2022-04-28 15:17:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 15:17:59,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:17:59,188 INFO L195 NwaCegarLoop]: 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-28 15:17:59,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:17:59,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:17:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:17:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 1 times [2022-04-28 15:17:59,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:59,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345150371] [2022-04-28 15:17:59,215 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:17:59,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:17:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 2 times [2022-04-28 15:17:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:17:59,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398720043] [2022-04-28 15:17:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:17:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:17:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:17:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:17:59,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {7473#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {7466#true} is VALID [2022-04-28 15:17:59,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-28 15:17:59,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7466#true} {7466#true} #661#return; {7466#true} is VALID [2022-04-28 15:17:59,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {7466#true} call ULTIMATE.init(); {7473#(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-28 15:17:59,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {7473#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {7466#true} is VALID [2022-04-28 15:17:59,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {7466#true} assume true; {7466#true} is VALID [2022-04-28 15:17:59,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7466#true} {7466#true} #661#return; {7466#true} is VALID [2022-04-28 15:17:59,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {7466#true} call #t~ret161 := main(); {7466#true} is VALID [2022-04-28 15:17:59,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {7466#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7466#true} is VALID [2022-04-28 15:17:59,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {7466#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7466#true} is VALID [2022-04-28 15:17:59,366 INFO L272 TraceCheckUtils]: 7: Hoare triple {7466#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7466#true} is VALID [2022-04-28 15:17:59,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {7466#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:17:59,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {7471#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7472#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {7472#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {7467#false} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {7467#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {7467#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {7467#false} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {7467#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {7467#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, 80 + ~s.offset, 8); {7467#false} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {7467#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {7467#false} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {7467#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {7467#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {7467#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {7467#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {7467#false} ~skip~0 := 0; {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {7467#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {7467#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {7467#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {7467#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {7467#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {7467#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {7467#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {7467#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {7467#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {7467#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {7467#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {7467#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {7467#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {7467#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {7467#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {7467#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {7467#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {7467#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {7467#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {7467#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {7467#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {7467#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {7467#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {7467#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {7467#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {7467#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {7467#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {7467#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {7467#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {7467#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {7467#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 63: Hoare triple {7467#false} assume 8672 == #t~mem79;havoc #t~mem79; {7467#false} is VALID [2022-04-28 15:17:59,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {7467#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {7467#false} is VALID [2022-04-28 15:17:59,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {7467#false} assume 4 == ~blastFlag~0; {7467#false} is VALID [2022-04-28 15:17:59,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {7467#false} assume !false; {7467#false} is VALID [2022-04-28 15:17:59,379 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-28 15:17:59,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:17:59,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398720043] [2022-04-28 15:17:59,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398720043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:59,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:59,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:59,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:17:59,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345150371] [2022-04-28 15:17:59,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345150371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:17:59,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:17:59,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:17:59,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324401002] [2022-04-28 15:17:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:17:59,381 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-28 15:17:59,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:17:59,382 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-28 15:17:59,438 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-28 15:17:59,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:17:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:17:59,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:17:59,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:17:59,439 INFO L87 Difference]: Start difference. First operand 148 states and 219 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-28 15:18:01,458 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-28 15:18:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:02,365 INFO L93 Difference]: Finished difference Result 283 states and 422 transitions. [2022-04-28 15:18:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:02,365 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-28 15:18:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:02,365 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-28 15:18:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-28 15:18:02,370 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-28 15:18:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-28 15:18:02,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 422 transitions. [2022-04-28 15:18:02,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:02,726 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:18:02,726 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:18:02,726 INFO L412 NwaCegarLoop]: 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-28 15:18:02,727 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:02,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:18:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:18:02,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:02,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:02,734 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:02,734 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:02,737 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-28 15:18:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-28 15:18:02,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:02,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:02,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 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 161 states. [2022-04-28 15:18:02,738 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 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 161 states. [2022-04-28 15:18:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:02,741 INFO L93 Difference]: Finished difference Result 161 states and 235 transitions. [2022-04-28 15:18:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions. [2022-04-28 15:18:02,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:02,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:02,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:02,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4965034965034965) internal successors, (214), 143 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2022-04-28 15:18:02,745 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 67 [2022-04-28 15:18:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:02,745 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2022-04-28 15:18:02,745 INFO L496 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-28 15:18:02,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 218 transitions. [2022-04-28 15:18:02,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2022-04-28 15:18:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 15:18:02,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:02,929 INFO L195 NwaCegarLoop]: 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-28 15:18:02,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:18:02,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 1 times [2022-04-28 15:18:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:02,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951574907] [2022-04-28 15:18:02,963 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:18:02,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 2 times [2022-04-28 15:18:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:02,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915972413] [2022-04-28 15:18:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:03,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {8669#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {8662#true} is VALID [2022-04-28 15:18:03,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-28 15:18:03,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8662#true} {8662#true} #661#return; {8662#true} is VALID [2022-04-28 15:18:03,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {8662#true} call ULTIMATE.init(); {8669#(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-28 15:18:03,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {8669#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {8662#true} is VALID [2022-04-28 15:18:03,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {8662#true} assume true; {8662#true} is VALID [2022-04-28 15:18:03,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8662#true} {8662#true} #661#return; {8662#true} is VALID [2022-04-28 15:18:03,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {8662#true} call #t~ret161 := main(); {8662#true} is VALID [2022-04-28 15:18:03,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {8662#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8662#true} is VALID [2022-04-28 15:18:03,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {8662#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {8662#true} is VALID [2022-04-28 15:18:03,083 INFO L272 TraceCheckUtils]: 7: Hoare triple {8662#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8662#true} is VALID [2022-04-28 15:18:03,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {8662#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:03,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {8667#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8668#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {8668#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {8663#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {8663#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {8663#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {8663#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, 80 + ~s.offset, 8); {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {8663#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {8663#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {8663#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {8663#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {8663#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {8663#false} ~skip~0 := 0; {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {8663#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {8663#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {8663#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {8663#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {8663#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {8663#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {8663#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {8663#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {8663#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 40: Hoare triple {8663#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {8663#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {8663#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {8663#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {8663#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {8663#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {8663#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {8663#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {8663#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {8663#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {8663#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {8663#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {8663#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {8663#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {8663#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {8663#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {8663#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {8663#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {8663#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {8663#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {8663#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {8663#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {8663#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {8663#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {8663#false} assume 8672 == #t~mem79;havoc #t~mem79; {8663#false} is VALID [2022-04-28 15:18:03,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {8663#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {8663#false} is VALID [2022-04-28 15:18:03,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {8663#false} assume 4 == ~blastFlag~0; {8663#false} is VALID [2022-04-28 15:18:03,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2022-04-28 15:18:03,095 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-28 15:18:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:03,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915972413] [2022-04-28 15:18:03,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915972413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:03,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:03,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:03,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:03,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951574907] [2022-04-28 15:18:03,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951574907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:03,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:03,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173141416] [2022-04-28 15:18:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:03,097 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-28 15:18:03,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:03,097 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-28 15:18:03,148 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-28 15:18:03,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:03,150 INFO L87 Difference]: Start difference. First operand 148 states and 218 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-28 15:18:05,174 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-28 15:18:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:06,196 INFO L93 Difference]: Finished difference Result 283 states and 421 transitions. [2022-04-28 15:18:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:06,197 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-28 15:18:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:06,197 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-28 15:18:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-28 15:18:06,200 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-28 15:18:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-28 15:18:06,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 421 transitions. [2022-04-28 15:18:06,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:06,555 INFO L225 Difference]: With dead ends: 283 [2022-04-28 15:18:06,555 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 15:18:06,555 INFO L412 NwaCegarLoop]: 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-28 15:18:06,556 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:06,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:18:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 15:18:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 15:18:06,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:06,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:06,569 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:06,569 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:06,572 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-28 15:18:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-28 15:18:06,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:06,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:06,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 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 161 states. [2022-04-28 15:18:06,574 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 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 161 states. [2022-04-28 15:18:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:06,579 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2022-04-28 15:18:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2022-04-28 15:18:06,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:06,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:06,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:06,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 143 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2022-04-28 15:18:06,583 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 68 [2022-04-28 15:18:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:06,583 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2022-04-28 15:18:06,583 INFO L496 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-28 15:18:06,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 217 transitions. [2022-04-28 15:18:06,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2022-04-28 15:18:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:18:06,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:06,769 INFO L195 NwaCegarLoop]: 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-28 15:18:06,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:18:06,769 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 1 times [2022-04-28 15:18:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:06,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836506270] [2022-04-28 15:18:06,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:18:06,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 2 times [2022-04-28 15:18:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:06,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916404910] [2022-04-28 15:18:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:06,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:06,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {9865#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {9858#true} is VALID [2022-04-28 15:18:06,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-28 15:18:06,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9858#true} {9858#true} #661#return; {9858#true} is VALID [2022-04-28 15:18:06,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {9858#true} call ULTIMATE.init(); {9865#(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-28 15:18:06,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {9865#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {9858#true} is VALID [2022-04-28 15:18:06,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {9858#true} assume true; {9858#true} is VALID [2022-04-28 15:18:06,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9858#true} {9858#true} #661#return; {9858#true} is VALID [2022-04-28 15:18:06,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {9858#true} call #t~ret161 := main(); {9858#true} is VALID [2022-04-28 15:18:06,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {9858#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9858#true} is VALID [2022-04-28 15:18:06,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {9858#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9858#true} is VALID [2022-04-28 15:18:06,941 INFO L272 TraceCheckUtils]: 7: Hoare triple {9858#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9858#true} is VALID [2022-04-28 15:18:06,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {9858#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:06,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {9863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9864#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-28 15:18:06,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {9864#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {9859#false} is VALID [2022-04-28 15:18:06,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {9859#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {9859#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9859#false} is VALID [2022-04-28 15:18:06,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {9859#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {9859#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, 80 + ~s.offset, 8); {9859#false} is VALID [2022-04-28 15:18:06,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {9859#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9859#false} is VALID [2022-04-28 15:18:06,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {9859#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {9859#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {9859#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {9859#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {9859#false} ~skip~0 := 0; {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {9859#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {9859#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {9859#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {9859#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {9859#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {9859#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {9859#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {9859#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {9859#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {9859#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {9859#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {9859#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {9859#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {9859#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {9859#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {9859#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {9859#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {9859#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {9859#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {9859#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {9859#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {9859#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {9859#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {9859#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {9859#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {9859#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {9859#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {9859#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {9859#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {9859#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {9859#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {9859#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {9859#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {9859#false} assume 8672 == #t~mem79;havoc #t~mem79; {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {9859#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {9859#false} assume 4 == ~blastFlag~0; {9859#false} is VALID [2022-04-28 15:18:06,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {9859#false} assume !false; {9859#false} is VALID [2022-04-28 15:18:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:06,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916404910] [2022-04-28 15:18:06,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916404910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:06,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:06,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:06,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:06,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836506270] [2022-04-28 15:18:06,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836506270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:06,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:06,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:06,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122004617] [2022-04-28 15:18:06,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:06,955 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-28 15:18:06,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:06,956 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-28 15:18:07,010 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-28 15:18:07,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:07,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:07,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:07,012 INFO L87 Difference]: Start difference. First operand 148 states and 217 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-28 15:18:09,039 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-28 15:18:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:10,006 INFO L93 Difference]: Finished difference Result 273 states and 407 transitions. [2022-04-28 15:18:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:10,006 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-28 15:18:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:10,007 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-28 15:18:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:18:10,010 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-28 15:18:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-28 15:18:10,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-28 15:18:10,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:10,348 INFO L225 Difference]: With dead ends: 273 [2022-04-28 15:18:10,348 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 15:18:10,349 INFO L412 NwaCegarLoop]: 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-28 15:18:10,349 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:10,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 15:18:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-04-28 15:18:10,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:10,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,354 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,355 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:10,357 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-28 15:18:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-28 15:18:10,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:10,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:10,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 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 151 states. [2022-04-28 15:18:10,358 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 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 151 states. [2022-04-28 15:18:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:10,361 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2022-04-28 15:18:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2022-04-28 15:18:10,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:10,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:10,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:10,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2022-04-28 15:18:10,364 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 69 [2022-04-28 15:18:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:10,364 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2022-04-28 15:18:10,365 INFO L496 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-28 15:18:10,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 216 transitions. [2022-04-28 15:18:10,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2022-04-28 15:18:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 15:18:10,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:10,557 INFO L195 NwaCegarLoop]: 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-28 15:18:10,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:18:10,557 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:10,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 1 times [2022-04-28 15:18:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:10,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903499650] [2022-04-28 15:18:10,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:10,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 2 times [2022-04-28 15:18:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:10,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391067650] [2022-04-28 15:18:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:10,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {11021#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {11014#true} is VALID [2022-04-28 15:18:10,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-28 15:18:10,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11014#true} {11014#true} #661#return; {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {11014#true} call ULTIMATE.init(); {11021#(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-28 15:18:10,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {11021#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {11014#true} assume true; {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11014#true} {11014#true} #661#return; {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {11014#true} call #t~ret161 := main(); {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {11014#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {11014#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L272 TraceCheckUtils]: 7: Hoare triple {11014#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {11014#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {11014#true} is VALID [2022-04-28 15:18:10,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {11014#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {11014#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {11014#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {11014#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {11014#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {11014#true} assume !false; {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {11014#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {11014#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {11014#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {11014#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {11014#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {11014#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {11014#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {11014#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {11014#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11014#true} is VALID [2022-04-28 15:18:10,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {11014#true} assume 8464 == #t~mem55;havoc #t~mem55; {11014#true} is VALID [2022-04-28 15:18:10,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {11014#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11014#true} is VALID [2022-04-28 15:18:10,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {11014#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11014#true} is VALID [2022-04-28 15:18:10,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {11014#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,739 INFO L290 TraceCheckUtils]: 55: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,740 INFO L290 TraceCheckUtils]: 59: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,741 INFO L290 TraceCheckUtils]: 60: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:18:10,742 INFO L290 TraceCheckUtils]: 64: Hoare triple {11019#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {11020#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-28 15:18:10,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {11020#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {11015#false} is VALID [2022-04-28 15:18:10,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {11015#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {11015#false} is VALID [2022-04-28 15:18:10,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {11015#false} assume 4 == ~blastFlag~0; {11015#false} is VALID [2022-04-28 15:18:10,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {11015#false} assume !false; {11015#false} is VALID [2022-04-28 15:18:10,744 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-28 15:18:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391067650] [2022-04-28 15:18:10,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391067650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:10,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:10,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:10,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903499650] [2022-04-28 15:18:10,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903499650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:10,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:10,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537738985] [2022-04-28 15:18:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:10,745 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-28 15:18:10,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:10,746 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-28 15:18:10,811 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-28 15:18:10,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:10,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:10,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:10,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:10,812 INFO L87 Difference]: Start difference. First operand 148 states and 216 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-28 15:18:12,836 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-28 15:18:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:13,986 INFO L93 Difference]: Finished difference Result 383 states and 576 transitions. [2022-04-28 15:18:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:13,986 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-28 15:18:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:13,987 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-28 15:18:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:18:13,990 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-28 15:18:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:18:13,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-28 15:18:14,445 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-28 15:18:14,450 INFO L225 Difference]: With dead ends: 383 [2022-04-28 15:18:14,451 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 15:18:14,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:14,452 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 108 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:14,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 313 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 15:18:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 191. [2022-04-28 15:18:14,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:14,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,460 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,460 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:14,465 INFO L93 Difference]: Finished difference Result 261 states and 389 transitions. [2022-04-28 15:18:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 389 transitions. [2022-04-28 15:18:14,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:14,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:14,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 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-28 15:18:14,467 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 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-28 15:18:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:14,472 INFO L93 Difference]: Finished difference Result 261 states and 389 transitions. [2022-04-28 15:18:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 389 transitions. [2022-04-28 15:18:14,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:14,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:14,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:14,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.5698924731182795) internal successors, (292), 186 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 296 transitions. [2022-04-28 15:18:14,477 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 296 transitions. Word has length 69 [2022-04-28 15:18:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:14,477 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 296 transitions. [2022-04-28 15:18:14,478 INFO L496 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-28 15:18:14,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 296 transitions. [2022-04-28 15:18:14,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-04-28 15:18:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 15:18:14,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:14,745 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 15:18:14,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:18:14,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 1 times [2022-04-28 15:18:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:14,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [733241789] [2022-04-28 15:18:14,765 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:14,765 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 2 times [2022-04-28 15:18:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:14,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727768556] [2022-04-28 15:18:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:14,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {12703#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {12696#true} is VALID [2022-04-28 15:18:14,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {12696#true} assume true; {12696#true} is VALID [2022-04-28 15:18:14,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12696#true} {12696#true} #661#return; {12696#true} is VALID [2022-04-28 15:18:14,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {12696#true} call ULTIMATE.init(); {12703#(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-28 15:18:14,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {12703#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {12696#true} assume true; {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12696#true} {12696#true} #661#return; {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {12696#true} call #t~ret161 := main(); {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {12696#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {12696#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L272 TraceCheckUtils]: 7: Hoare triple {12696#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {12696#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {12696#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12696#true} is VALID [2022-04-28 15:18:14,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {12696#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {12696#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {12696#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {12696#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {12696#true} assume !false; {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {12696#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {12696#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {12696#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {12696#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {12696#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {12696#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {12696#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {12696#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {12696#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12696#true} is VALID [2022-04-28 15:18:14,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {12696#true} assume 8464 == #t~mem55;havoc #t~mem55; {12696#true} is VALID [2022-04-28 15:18:14,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {12696#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {12696#true} is VALID [2022-04-28 15:18:14,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {12696#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12696#true} is VALID [2022-04-28 15:18:14,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {12696#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:14,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {12701#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12702#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 15:18:14,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {12702#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {12697#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {12697#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {12697#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {12697#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 49: Hoare triple {12697#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 50: Hoare triple {12697#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 51: Hoare triple {12697#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {12697#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {12697#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {12697#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {12697#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {12697#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {12697#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {12697#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 59: Hoare triple {12697#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {12697#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {12697#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {12697#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {12697#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {12697#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {12697#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {12697#false} is VALID [2022-04-28 15:18:14,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {12697#false} assume 8673 == #t~mem80;havoc #t~mem80; {12697#false} is VALID [2022-04-28 15:18:14,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {12697#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {12697#false} is VALID [2022-04-28 15:18:14,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {12697#false} assume 4 == ~blastFlag~0; {12697#false} is VALID [2022-04-28 15:18:14,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {12697#false} assume !false; {12697#false} is VALID [2022-04-28 15:18:14,905 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-28 15:18:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:14,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727768556] [2022-04-28 15:18:14,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727768556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:14,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:14,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:14,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:14,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [733241789] [2022-04-28 15:18:14,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [733241789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:14,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:14,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:14,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246774219] [2022-04-28 15:18:14,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:14,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 15:18:14,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:14,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:14,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:14,969 INFO L87 Difference]: Start difference. First operand 191 states and 296 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:16,995 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-28 15:18:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:17,948 INFO L93 Difference]: Finished difference Result 399 states and 628 transitions. [2022-04-28 15:18:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:17,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 15:18:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-28 15:18:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-28 15:18:17,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-28 15:18:18,317 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-28 15:18:18,321 INFO L225 Difference]: With dead ends: 399 [2022-04-28 15:18:18,321 INFO L226 Difference]: Without dead ends: 234 [2022-04-28 15:18:18,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:18,322 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 34 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:18,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 473 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-04-28 15:18:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2022-04-28 15:18:18,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:18,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:18,330 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:18,331 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:18,335 INFO L93 Difference]: Finished difference Result 234 states and 361 transitions. [2022-04-28 15:18:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2022-04-28 15:18:18,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:18,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:18,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 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 234 states. [2022-04-28 15:18:18,336 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 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 234 states. [2022-04-28 15:18:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:18,341 INFO L93 Difference]: Finished difference Result 234 states and 361 transitions. [2022-04-28 15:18:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2022-04-28 15:18:18,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:18,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:18,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:18,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.5865384615384615) internal successors, (330), 208 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 334 transitions. [2022-04-28 15:18:18,347 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 334 transitions. Word has length 70 [2022-04-28 15:18:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:18,347 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 334 transitions. [2022-04-28 15:18:18,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:18,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 334 transitions. [2022-04-28 15:18:18,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-28 15:18:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 15:18:18,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:18,638 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 15:18:18,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:18:18,639 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2025171509, now seen corresponding path program 1 times [2022-04-28 15:18:18,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:18,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240687414] [2022-04-28 15:18:18,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:18,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2025171509, now seen corresponding path program 2 times [2022-04-28 15:18:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:18,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711022609] [2022-04-28 15:18:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:18,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:18,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {14407#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {14400#true} is VALID [2022-04-28 15:18:18,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {14400#true} assume true; {14400#true} is VALID [2022-04-28 15:18:18,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14400#true} {14400#true} #661#return; {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {14400#true} call ULTIMATE.init(); {14407#(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-28 15:18:18,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {14407#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {14400#true} assume true; {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14400#true} {14400#true} #661#return; {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {14400#true} call #t~ret161 := main(); {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {14400#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {14400#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L272 TraceCheckUtils]: 7: Hoare triple {14400#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14400#true} is VALID [2022-04-28 15:18:18,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {14400#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {14400#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {14400#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {14400#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {14400#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {14400#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {14400#true} assume !false; {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {14400#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {14400#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {14400#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {14400#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {14400#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {14400#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {14400#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {14400#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {14400#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {14400#true} assume 8464 == #t~mem55;havoc #t~mem55; {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {14400#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {14400#true} is VALID [2022-04-28 15:18:18,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {14400#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {14400#true} is VALID [2022-04-28 15:18:18,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {14400#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:18,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {14405#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14406#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 15:18:18,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {14406#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {14401#false} is VALID [2022-04-28 15:18:18,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {14401#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14401#false} is VALID [2022-04-28 15:18:18,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {14401#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {14401#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {14401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {14401#false} ~skip~0 := 0; {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {14401#false} assume !false; {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {14401#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {14401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {14401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {14401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {14401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {14401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {14401#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {14401#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {14401#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,849 INFO L290 TraceCheckUtils]: 54: Hoare triple {14401#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,849 INFO L290 TraceCheckUtils]: 55: Hoare triple {14401#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {14401#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,849 INFO L290 TraceCheckUtils]: 57: Hoare triple {14401#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {14401#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {14401#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {14401#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {14401#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {14401#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {14401#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {14401#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 65: Hoare triple {14401#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 66: Hoare triple {14401#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 67: Hoare triple {14401#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 68: Hoare triple {14401#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 69: Hoare triple {14401#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 70: Hoare triple {14401#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,857 INFO L290 TraceCheckUtils]: 71: Hoare triple {14401#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {14401#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {14401#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 74: Hoare triple {14401#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 75: Hoare triple {14401#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 76: Hoare triple {14401#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 77: Hoare triple {14401#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 78: Hoare triple {14401#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 79: Hoare triple {14401#false} assume 8673 == #t~mem80;havoc #t~mem80; {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {14401#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {14401#false} is VALID [2022-04-28 15:18:18,858 INFO L290 TraceCheckUtils]: 81: Hoare triple {14401#false} assume 4 == ~blastFlag~0; {14401#false} is VALID [2022-04-28 15:18:18,859 INFO L290 TraceCheckUtils]: 82: Hoare triple {14401#false} assume !false; {14401#false} is VALID [2022-04-28 15:18:18,859 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-28 15:18:18,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:18,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711022609] [2022-04-28 15:18:18,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711022609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:18,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:18,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:18,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:18,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240687414] [2022-04-28 15:18:18,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240687414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:18,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:18,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:18,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801371280] [2022-04-28 15:18:18,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:18,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:18:18,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:18,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:18,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:18,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:18,926 INFO L87 Difference]: Start difference. First operand 213 states and 334 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:20,951 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-28 15:18:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:22,033 INFO L93 Difference]: Finished difference Result 421 states and 665 transitions. [2022-04-28 15:18:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 15:18:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:18:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-28 15:18:22,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-28 15:18:22,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:22,370 INFO L225 Difference]: With dead ends: 421 [2022-04-28 15:18:22,370 INFO L226 Difference]: Without dead ends: 234 [2022-04-28 15:18:22,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:22,371 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 39 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:22,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 473 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:18:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-04-28 15:18:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2022-04-28 15:18:22,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:22,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:22,380 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:22,380 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:22,385 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2022-04-28 15:18:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2022-04-28 15:18:22,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:22,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:22,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 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 234 states. [2022-04-28 15:18:22,387 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 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 234 states. [2022-04-28 15:18:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:22,391 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2022-04-28 15:18:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2022-04-28 15:18:22,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:22,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:22,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:22,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 208 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 333 transitions. [2022-04-28 15:18:22,397 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 333 transitions. Word has length 83 [2022-04-28 15:18:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:22,397 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 333 transitions. [2022-04-28 15:18:22,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:22,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 333 transitions. [2022-04-28 15:18:22,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-28 15:18:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:18:22,646 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:22,646 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:22,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:18:22,647 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 1 times [2022-04-28 15:18:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:22,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041643318] [2022-04-28 15:18:22,692 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:22,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 2 times [2022-04-28 15:18:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:22,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768021325] [2022-04-28 15:18:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:22,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {16155#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {16148#true} is VALID [2022-04-28 15:18:22,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {16148#true} assume true; {16148#true} is VALID [2022-04-28 15:18:22,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16148#true} {16148#true} #661#return; {16148#true} is VALID [2022-04-28 15:18:22,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {16148#true} call ULTIMATE.init(); {16155#(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-28 15:18:22,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {16155#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {16148#true} is VALID [2022-04-28 15:18:22,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {16148#true} assume true; {16148#true} is VALID [2022-04-28 15:18:22,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16148#true} {16148#true} #661#return; {16148#true} is VALID [2022-04-28 15:18:22,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {16148#true} call #t~ret161 := main(); {16148#true} is VALID [2022-04-28 15:18:22,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {16148#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {16148#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L272 TraceCheckUtils]: 7: Hoare triple {16148#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {16148#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {16148#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {16148#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {16148#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {16148#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {16148#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {16148#true} assume !false; {16148#true} is VALID [2022-04-28 15:18:22,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {16148#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {16148#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {16148#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {16148#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {16148#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {16148#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {16148#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {16148#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {16148#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {16148#true} assume 8464 == #t~mem55;havoc #t~mem55; {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {16148#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {16148#true} is VALID [2022-04-28 15:18:22,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {16148#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {16148#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {16148#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {16148#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {16148#true} ~skip~0 := 0; {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {16148#true} assume !false; {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {16148#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {16148#true} assume 12292 == #t~mem47;havoc #t~mem47; {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {16148#true} call write~int(1, ~s.base, 60 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {16148#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {16148#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {16148#true} is VALID [2022-04-28 15:18:22,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {16148#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {16148#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {16148#true} is VALID [2022-04-28 15:18:22,846 INFO L290 TraceCheckUtils]: 39: Hoare triple {16148#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {16148#true} is VALID [2022-04-28 15:18:22,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {16148#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {16148#true} is VALID [2022-04-28 15:18:22,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {16148#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:18:22,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {16153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16154#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 15:18:22,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {16154#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {16149#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {16149#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 55: Hoare triple {16149#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {16149#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {16149#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {16149#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {16149#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {16149#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {16149#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 62: Hoare triple {16149#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {16149#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {16149#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {16149#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 66: Hoare triple {16149#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 67: Hoare triple {16149#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {16149#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {16149#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {16149#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 71: Hoare triple {16149#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {16149#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {16149#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {16149#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {16149#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {16149#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {16149#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {16149#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 79: Hoare triple {16149#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 80: Hoare triple {16149#false} assume 8673 == #t~mem80;havoc #t~mem80; {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 81: Hoare triple {16149#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 82: Hoare triple {16149#false} assume 4 == ~blastFlag~0; {16149#false} is VALID [2022-04-28 15:18:22,854 INFO L290 TraceCheckUtils]: 83: Hoare triple {16149#false} assume !false; {16149#false} is VALID [2022-04-28 15:18:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 15:18:22,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:22,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768021325] [2022-04-28 15:18:22,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768021325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:22,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:22,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:22,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:22,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041643318] [2022-04-28 15:18:22,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041643318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:22,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:22,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:22,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611035573] [2022-04-28 15:18:22,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:22,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:18:22,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:22,857 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-28 15:18:22,927 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-28 15:18:22,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:22,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:22,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:22,928 INFO L87 Difference]: Start difference. First operand 213 states and 333 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-28 15:18:24,958 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-28 15:18:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:26,000 INFO L93 Difference]: Finished difference Result 429 states and 679 transitions. [2022-04-28 15:18:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:18:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:26,001 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-28 15:18:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:18:26,004 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-28 15:18:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-28 15:18:26,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-28 15:18:26,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:26,295 INFO L225 Difference]: With dead ends: 429 [2022-04-28 15:18:26,295 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 15:18:26,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:26,296 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 22 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:26,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 548 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:18:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 15:18:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-04-28 15:18:26,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:26,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,305 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,305 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:26,310 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-28 15:18:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-28 15:18:26,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:26,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:26,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 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 242 states. [2022-04-28 15:18:26,311 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 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 242 states. [2022-04-28 15:18:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:26,315 INFO L93 Difference]: Finished difference Result 242 states and 375 transitions. [2022-04-28 15:18:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 375 transitions. [2022-04-28 15:18:26,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:26,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:26,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:26,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5848214285714286) internal successors, (355), 224 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2022-04-28 15:18:26,321 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 84 [2022-04-28 15:18:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:26,322 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2022-04-28 15:18:26,322 INFO L496 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-28 15:18:26,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 359 transitions. [2022-04-28 15:18:26,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2022-04-28 15:18:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:18:26,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:26,568 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:26,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:18:26,568 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:26,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1354545936, now seen corresponding path program 1 times [2022-04-28 15:18:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [333819468] [2022-04-28 15:18:26,607 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:26,607 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1354545936, now seen corresponding path program 2 times [2022-04-28 15:18:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:26,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78864578] [2022-04-28 15:18:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:26,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {17967#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {17960#true} is VALID [2022-04-28 15:18:26,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {17960#true} assume true; {17960#true} is VALID [2022-04-28 15:18:26,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17960#true} {17960#true} #661#return; {17960#true} is VALID [2022-04-28 15:18:26,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {17960#true} call ULTIMATE.init(); {17967#(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-28 15:18:26,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {17967#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {17960#true} is VALID [2022-04-28 15:18:26,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {17960#true} assume true; {17960#true} is VALID [2022-04-28 15:18:26,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17960#true} {17960#true} #661#return; {17960#true} is VALID [2022-04-28 15:18:26,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {17960#true} call #t~ret161 := main(); {17960#true} is VALID [2022-04-28 15:18:26,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {17960#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {17960#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L272 TraceCheckUtils]: 7: Hoare triple {17960#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {17960#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {17960#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {17960#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {17960#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {17960#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {17960#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {17960#true} assume !false; {17960#true} is VALID [2022-04-28 15:18:26,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {17960#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {17960#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {17960#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {17960#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {17960#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {17960#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {17960#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {17960#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {17960#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {17960#true} assume 8464 == #t~mem55;havoc #t~mem55; {17960#true} is VALID [2022-04-28 15:18:26,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {17960#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17960#true} is VALID [2022-04-28 15:18:26,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {17960#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17960#true} is VALID [2022-04-28 15:18:26,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {17960#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:26,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {17965#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17966#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {17966#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {17961#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {17961#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {17961#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {17961#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {17961#false} ~skip~0 := 0; {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {17961#false} assume !false; {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {17961#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {17961#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {17961#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {17961#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {17961#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {17961#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {17961#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {17961#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {17961#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {17961#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {17961#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {17961#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {17961#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {17961#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {17961#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {17961#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {17961#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {17961#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {17961#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {17961#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {17961#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {17961#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,797 INFO L290 TraceCheckUtils]: 68: Hoare triple {17961#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 69: Hoare triple {17961#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {17961#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {17961#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {17961#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {17961#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {17961#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {17961#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {17961#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {17961#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {17961#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {17961#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {17961#false} is VALID [2022-04-28 15:18:26,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {17961#false} assume 8673 == #t~mem80;havoc #t~mem80; {17961#false} is VALID [2022-04-28 15:18:26,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {17961#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {17961#false} is VALID [2022-04-28 15:18:26,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {17961#false} assume 4 == ~blastFlag~0; {17961#false} is VALID [2022-04-28 15:18:26,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {17961#false} assume !false; {17961#false} is VALID [2022-04-28 15:18:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:26,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78864578] [2022-04-28 15:18:26,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78864578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:26,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:26,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:26,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [333819468] [2022-04-28 15:18:26,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [333819468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:26,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:26,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248810046] [2022-04-28 15:18:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:18:26,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:26,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:26,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:26,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:26,874 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:28,898 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-28 15:18:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:29,867 INFO L93 Difference]: Finished difference Result 451 states and 713 transitions. [2022-04-28 15:18:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:18:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:18:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-28 15:18:29,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-28 15:18:30,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:30,249 INFO L225 Difference]: With dead ends: 451 [2022-04-28 15:18:30,249 INFO L226 Difference]: Without dead ends: 248 [2022-04-28 15:18:30,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:30,250 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:30,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 477 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-04-28 15:18:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2022-04-28 15:18:30,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:30,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,262 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,263 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:30,267 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-28 15:18:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-28 15:18:30,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:30,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:30,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 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 248 states. [2022-04-28 15:18:30,269 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 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 248 states. [2022-04-28 15:18:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:30,273 INFO L93 Difference]: Finished difference Result 248 states and 383 transitions. [2022-04-28 15:18:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-04-28 15:18:30,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:30,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:30,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:30,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5803571428571428) internal successors, (354), 224 states have internal predecessors, (354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 358 transitions. [2022-04-28 15:18:30,279 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 358 transitions. Word has length 84 [2022-04-28 15:18:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:30,279 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 358 transitions. [2022-04-28 15:18:30,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 358 transitions. [2022-04-28 15:18:30,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 358 transitions. [2022-04-28 15:18:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 15:18:30,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:30,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:30,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:18:30,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 1 times [2022-04-28 15:18:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:30,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [612717148] [2022-04-28 15:18:30,579 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:30,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 2 times [2022-04-28 15:18:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:30,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655522941] [2022-04-28 15:18:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:30,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {19835#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {19828#true} is VALID [2022-04-28 15:18:30,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {19828#true} assume true; {19828#true} is VALID [2022-04-28 15:18:30,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19828#true} {19828#true} #661#return; {19828#true} is VALID [2022-04-28 15:18:30,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {19828#true} call ULTIMATE.init(); {19835#(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-28 15:18:30,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {19835#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {19828#true} is VALID [2022-04-28 15:18:30,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {19828#true} assume true; {19828#true} is VALID [2022-04-28 15:18:30,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19828#true} {19828#true} #661#return; {19828#true} is VALID [2022-04-28 15:18:30,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {19828#true} call #t~ret161 := main(); {19828#true} is VALID [2022-04-28 15:18:30,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {19828#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19828#true} is VALID [2022-04-28 15:18:30,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {19828#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L272 TraceCheckUtils]: 7: Hoare triple {19828#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {19828#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {19828#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {19828#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {19828#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {19828#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {19828#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {19828#true} assume !false; {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {19828#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {19828#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {19828#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {19828#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {19828#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {19828#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {19828#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {19828#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {19828#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {19828#true} assume 8464 == #t~mem55;havoc #t~mem55; {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {19828#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {19828#true} is VALID [2022-04-28 15:18:30,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {19828#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19828#true} is VALID [2022-04-28 15:18:30,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {19828#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:30,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {19833#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19834#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-28 15:18:30,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {19834#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {19829#false} is VALID [2022-04-28 15:18:30,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {19829#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {19829#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {19829#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19829#false} is VALID [2022-04-28 15:18:30,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {19829#false} ~skip~0 := 0; {19829#false} is VALID [2022-04-28 15:18:30,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {19829#false} assume !false; {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {19829#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {19829#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {19829#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {19829#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 50: Hoare triple {19829#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {19829#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {19829#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {19829#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 54: Hoare triple {19829#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,716 INFO L290 TraceCheckUtils]: 55: Hoare triple {19829#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {19829#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {19829#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 58: Hoare triple {19829#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 59: Hoare triple {19829#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 60: Hoare triple {19829#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {19829#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {19829#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {19829#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 64: Hoare triple {19829#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,717 INFO L290 TraceCheckUtils]: 65: Hoare triple {19829#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {19829#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 67: Hoare triple {19829#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {19829#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {19829#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {19829#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 71: Hoare triple {19829#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 72: Hoare triple {19829#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {19829#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {19829#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 75: Hoare triple {19829#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,718 INFO L290 TraceCheckUtils]: 76: Hoare triple {19829#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {19829#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,719 INFO L290 TraceCheckUtils]: 78: Hoare triple {19829#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {19829#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {19829#false} is VALID [2022-04-28 15:18:30,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {19829#false} assume 8673 == #t~mem80;havoc #t~mem80; {19829#false} is VALID [2022-04-28 15:18:30,719 INFO L290 TraceCheckUtils]: 81: Hoare triple {19829#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {19829#false} is VALID [2022-04-28 15:18:30,719 INFO L290 TraceCheckUtils]: 82: Hoare triple {19829#false} assume 4 == ~blastFlag~0; {19829#false} is VALID [2022-04-28 15:18:30,719 INFO L290 TraceCheckUtils]: 83: Hoare triple {19829#false} assume !false; {19829#false} is VALID [2022-04-28 15:18:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:30,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655522941] [2022-04-28 15:18:30,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655522941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:30,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:30,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:30,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:30,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [612717148] [2022-04-28 15:18:30,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [612717148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:30,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:30,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:30,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673632439] [2022-04-28 15:18:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:30,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:18:30,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:30,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:30,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:30,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:30,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:30,782 INFO L87 Difference]: Start difference. First operand 229 states and 358 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:32,804 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-28 15:18:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:33,736 INFO L93 Difference]: Finished difference Result 450 states and 710 transitions. [2022-04-28 15:18:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-28 15:18:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:18:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:18:33,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:18:34,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:34,120 INFO L225 Difference]: With dead ends: 450 [2022-04-28 15:18:34,121 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 15:18:34,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:34,124 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 35 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:34,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 479 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 15:18:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 229. [2022-04-28 15:18:34,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:34,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,133 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,133 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:34,138 INFO L93 Difference]: Finished difference Result 247 states and 381 transitions. [2022-04-28 15:18:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 381 transitions. [2022-04-28 15:18:34,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:34,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:34,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 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 247 states. [2022-04-28 15:18:34,140 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 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 247 states. [2022-04-28 15:18:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:34,145 INFO L93 Difference]: Finished difference Result 247 states and 381 transitions. [2022-04-28 15:18:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 381 transitions. [2022-04-28 15:18:34,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:34,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:34,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:34,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.5758928571428572) internal successors, (353), 224 states have internal predecessors, (353), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 357 transitions. [2022-04-28 15:18:34,151 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 357 transitions. Word has length 84 [2022-04-28 15:18:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:34,151 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 357 transitions. [2022-04-28 15:18:34,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 357 transitions. [2022-04-28 15:18:34,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 357 transitions. [2022-04-28 15:18:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:18:34,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:34,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:34,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:18:34,434 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 1 times [2022-04-28 15:18:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:34,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707023554] [2022-04-28 15:18:34,479 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:34,479 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 2 times [2022-04-28 15:18:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:34,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767989953] [2022-04-28 15:18:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:34,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {21700#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {21692#true} is VALID [2022-04-28 15:18:34,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {21692#true} assume true; {21692#true} is VALID [2022-04-28 15:18:34,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21692#true} {21692#true} #661#return; {21692#true} is VALID [2022-04-28 15:18:34,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {21692#true} call ULTIMATE.init(); {21700#(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-28 15:18:34,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {21700#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {21692#true} is VALID [2022-04-28 15:18:34,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {21692#true} assume true; {21692#true} is VALID [2022-04-28 15:18:34,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21692#true} {21692#true} #661#return; {21692#true} is VALID [2022-04-28 15:18:34,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {21692#true} call #t~ret161 := main(); {21692#true} is VALID [2022-04-28 15:18:34,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {21692#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21692#true} is VALID [2022-04-28 15:18:34,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {21692#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {21692#true} is VALID [2022-04-28 15:18:34,612 INFO L272 TraceCheckUtils]: 7: Hoare triple {21692#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {21692#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {21692#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {21692#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {21692#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {21692#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {21692#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {21692#true} assume !false; {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {21692#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {21692#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {21692#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {21692#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {21692#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {21692#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {21692#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {21692#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {21692#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {21692#true} assume 8464 == #t~mem55;havoc #t~mem55; {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {21692#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {21692#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21692#true} is VALID [2022-04-28 15:18:34,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {21692#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {21692#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {21692#true} is VALID [2022-04-28 15:18:34,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {21692#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21692#true} is VALID [2022-04-28 15:18:34,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {21692#true} ~skip~0 := 0; {21692#true} is VALID [2022-04-28 15:18:34,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {21692#true} assume !false; {21692#true} is VALID [2022-04-28 15:18:34,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {21692#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21697#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {21697#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 12292 == #t~mem47;havoc #t~mem47; {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 60 + ~s.offset, 4); {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(1, ~s.base, 56 + ~s.offset, 4); {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} 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, 80 + ~s.offset, 8); {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:34,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {21698#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {21699#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-28 15:18:34,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {21699#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {21693#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {21693#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {21693#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {21693#false} ~skip~0 := 0; {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {21693#false} assume !false; {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {21693#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {21693#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {21693#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,621 INFO L290 TraceCheckUtils]: 50: Hoare triple {21693#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {21693#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {21693#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {21693#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {21693#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 55: Hoare triple {21693#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {21693#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {21693#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {21693#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {21693#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {21693#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {21693#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {21693#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {21693#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {21693#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 65: Hoare triple {21693#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 66: Hoare triple {21693#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {21693#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {21693#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {21693#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {21693#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 71: Hoare triple {21693#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,632 INFO L290 TraceCheckUtils]: 72: Hoare triple {21693#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {21693#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {21693#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 75: Hoare triple {21693#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 76: Hoare triple {21693#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 77: Hoare triple {21693#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 78: Hoare triple {21693#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 79: Hoare triple {21693#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 80: Hoare triple {21693#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 81: Hoare triple {21693#false} assume 8673 == #t~mem80;havoc #t~mem80; {21693#false} is VALID [2022-04-28 15:18:34,633 INFO L290 TraceCheckUtils]: 82: Hoare triple {21693#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {21693#false} is VALID [2022-04-28 15:18:34,634 INFO L290 TraceCheckUtils]: 83: Hoare triple {21693#false} assume 4 == ~blastFlag~0; {21693#false} is VALID [2022-04-28 15:18:34,634 INFO L290 TraceCheckUtils]: 84: Hoare triple {21693#false} assume !false; {21693#false} is VALID [2022-04-28 15:18:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 15:18:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767989953] [2022-04-28 15:18:34,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767989953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:34,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:34,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:18:34,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:34,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707023554] [2022-04-28 15:18:34,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707023554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:34,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:34,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 15:18:34,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263148191] [2022-04-28 15:18:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:18:34,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:34,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:34,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:34,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 15:18:34,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:34,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 15:18:34,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:34,706 INFO L87 Difference]: Start difference. First operand 229 states and 357 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:36,737 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-28 15:18:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:37,782 INFO L93 Difference]: Finished difference Result 441 states and 696 transitions. [2022-04-28 15:18:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 15:18:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:18:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-28 15:18:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-28 15:18:37,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 403 transitions. [2022-04-28 15:18:38,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:38,056 INFO L225 Difference]: With dead ends: 441 [2022-04-28 15:18:38,056 INFO L226 Difference]: Without dead ends: 238 [2022-04-28 15:18:38,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:18:38,057 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:38,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 593 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:18:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-28 15:18:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-04-28 15:18:38,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:38,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,065 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,066 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:38,070 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-28 15:18:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:18:38,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:38,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:38,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 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 238 states. [2022-04-28 15:18:38,071 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 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 238 states. [2022-04-28 15:18:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:38,075 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2022-04-28 15:18:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:18:38,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:38,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:38,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:38,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.5622317596566524) internal successors, (364), 233 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 368 transitions. [2022-04-28 15:18:38,081 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 368 transitions. Word has length 85 [2022-04-28 15:18:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:38,081 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 368 transitions. [2022-04-28 15:18:38,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 368 transitions. [2022-04-28 15:18:38,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2022-04-28 15:18:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 15:18:38,347 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:38,347 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:38,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:18:38,348 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:38,348 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 1 times [2022-04-28 15:18:38,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:38,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780911145] [2022-04-28 15:18:38,384 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:38,384 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 2 times [2022-04-28 15:18:38,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:38,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361167729] [2022-04-28 15:18:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:38,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {23546#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {23539#true} is VALID [2022-04-28 15:18:38,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {23539#true} assume true; {23539#true} is VALID [2022-04-28 15:18:38,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23539#true} {23539#true} #661#return; {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {23539#true} call ULTIMATE.init(); {23546#(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-28 15:18:38,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {23546#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {23539#true} assume true; {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23539#true} {23539#true} #661#return; {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {23539#true} call #t~ret161 := main(); {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {23539#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {23539#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L272 TraceCheckUtils]: 7: Hoare triple {23539#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23539#true} is VALID [2022-04-28 15:18:38,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {23539#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {23539#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {23539#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {23539#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {23539#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {23539#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {23539#true} assume !false; {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {23539#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {23539#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {23539#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {23539#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {23539#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {23539#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {23539#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {23539#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {23539#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {23539#true} assume 8464 == #t~mem55;havoc #t~mem55; {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {23539#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {23539#true} is VALID [2022-04-28 15:18:38,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {23539#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23539#true} is VALID [2022-04-28 15:18:38,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {23539#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:38,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:38,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:38,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} ~skip~0 := 0; {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:38,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:38,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:18:38,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {23544#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23545#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 15:18:38,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {23545#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {23540#false} is VALID [2022-04-28 15:18:38,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {23540#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {23540#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23540#false} is VALID [2022-04-28 15:18:38,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {23540#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {23540#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, 80 + ~s.offset, 8); {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {23540#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {23540#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {23540#false} assume 12292 != #t~mem85;havoc #t~mem85; {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {23540#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {23540#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {23540#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {23540#false} ~skip~0 := 0; {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {23540#false} assume !false; {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {23540#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {23540#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {23540#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {23540#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {23540#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {23540#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {23540#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {23540#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {23540#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {23540#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {23540#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {23540#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {23540#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {23540#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {23540#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {23540#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {23540#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {23540#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {23540#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {23540#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {23540#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {23540#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {23540#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 70: Hoare triple {23540#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 71: Hoare triple {23540#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {23540#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 73: Hoare triple {23540#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 74: Hoare triple {23540#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 75: Hoare triple {23540#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 76: Hoare triple {23540#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 77: Hoare triple {23540#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 78: Hoare triple {23540#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,517 INFO L290 TraceCheckUtils]: 79: Hoare triple {23540#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {23540#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {23540#false} is VALID [2022-04-28 15:18:38,518 INFO L290 TraceCheckUtils]: 81: Hoare triple {23540#false} assume 8673 == #t~mem80;havoc #t~mem80; {23540#false} is VALID [2022-04-28 15:18:38,518 INFO L290 TraceCheckUtils]: 82: Hoare triple {23540#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {23540#false} is VALID [2022-04-28 15:18:38,518 INFO L290 TraceCheckUtils]: 83: Hoare triple {23540#false} assume 4 == ~blastFlag~0; {23540#false} is VALID [2022-04-28 15:18:38,518 INFO L290 TraceCheckUtils]: 84: Hoare triple {23540#false} assume !false; {23540#false} is VALID [2022-04-28 15:18:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:38,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361167729] [2022-04-28 15:18:38,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361167729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:38,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:38,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:38,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:38,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780911145] [2022-04-28 15:18:38,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780911145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:38,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:38,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:38,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519425957] [2022-04-28 15:18:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:38,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:18:38,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:38,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:38,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:38,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:38,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:38,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:38,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:38,618 INFO L87 Difference]: Start difference. First operand 238 states and 368 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:40,645 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-28 15:18:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:41,741 INFO L93 Difference]: Finished difference Result 572 states and 891 transitions. [2022-04-28 15:18:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:41,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 15:18:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:18:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 15:18:41,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-28 15:18:42,123 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-28 15:18:42,130 INFO L225 Difference]: With dead ends: 572 [2022-04-28 15:18:42,130 INFO L226 Difference]: Without dead ends: 360 [2022-04-28 15:18:42,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:42,131 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 140 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:42,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-28 15:18:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 250. [2022-04-28 15:18:42,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:42,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:42,142 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:42,142 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:42,149 INFO L93 Difference]: Finished difference Result 360 states and 549 transitions. [2022-04-28 15:18:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 549 transitions. [2022-04-28 15:18:42,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:42,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:42,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 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 360 states. [2022-04-28 15:18:42,150 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 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 360 states. [2022-04-28 15:18:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:42,157 INFO L93 Difference]: Finished difference Result 360 states and 549 transitions. [2022-04-28 15:18:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 549 transitions. [2022-04-28 15:18:42,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:42,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:42,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:42,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.546938775510204) internal successors, (379), 245 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 383 transitions. [2022-04-28 15:18:42,164 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 383 transitions. Word has length 85 [2022-04-28 15:18:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:42,164 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 383 transitions. [2022-04-28 15:18:42,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:42,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 383 transitions. [2022-04-28 15:18:42,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-28 15:18:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 15:18:42,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:42,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:42,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:18:42,464 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 1 times [2022-04-28 15:18:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:42,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638685041] [2022-04-28 15:18:42,507 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:42,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 2 times [2022-04-28 15:18:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647383529] [2022-04-28 15:18:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:42,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {25922#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {25915#true} is VALID [2022-04-28 15:18:42,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {25915#true} assume true; {25915#true} is VALID [2022-04-28 15:18:42,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25915#true} {25915#true} #661#return; {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {25915#true} call ULTIMATE.init(); {25922#(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-28 15:18:42,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {25922#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {25915#true} assume true; {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25915#true} {25915#true} #661#return; {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {25915#true} call #t~ret161 := main(); {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {25915#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {25915#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L272 TraceCheckUtils]: 7: Hoare triple {25915#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25915#true} is VALID [2022-04-28 15:18:42,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {25915#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {25915#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {25915#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {25915#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {25915#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {25915#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {25915#true} assume !false; {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {25915#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {25915#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {25915#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {25915#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {25915#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {25915#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {25915#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {25915#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {25915#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25915#true} is VALID [2022-04-28 15:18:42,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {25915#true} assume 8464 == #t~mem55;havoc #t~mem55; {25915#true} is VALID [2022-04-28 15:18:42,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {25915#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25915#true} is VALID [2022-04-28 15:18:42,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {25915#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25915#true} is VALID [2022-04-28 15:18:42,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {25915#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:42,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:42,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:42,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:42,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:42,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:42,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:42,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {25920#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25921#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {25921#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {25916#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {25916#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {25916#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {25916#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, 80 + ~s.offset, 8); {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {25916#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {25916#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {25916#false} assume 12292 != #t~mem85;havoc #t~mem85; {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {25916#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {25916#false} is VALID [2022-04-28 15:18:42,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {25916#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {25916#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {25916#false} ~skip~0 := 0; {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {25916#false} assume !false; {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {25916#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {25916#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {25916#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {25916#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {25916#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {25916#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {25916#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {25916#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {25916#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {25916#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {25916#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {25916#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {25916#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {25916#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {25916#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {25916#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 64: Hoare triple {25916#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {25916#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {25916#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {25916#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {25916#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {25916#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {25916#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 71: Hoare triple {25916#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 72: Hoare triple {25916#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {25916#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {25916#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,642 INFO L290 TraceCheckUtils]: 75: Hoare triple {25916#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {25916#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 77: Hoare triple {25916#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {25916#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {25916#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {25916#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 81: Hoare triple {25916#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {25916#false} assume 8673 == #t~mem80;havoc #t~mem80; {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {25916#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 84: Hoare triple {25916#false} assume 4 == ~blastFlag~0; {25916#false} is VALID [2022-04-28 15:18:42,643 INFO L290 TraceCheckUtils]: 85: Hoare triple {25916#false} assume !false; {25916#false} is VALID [2022-04-28 15:18:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:42,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647383529] [2022-04-28 15:18:42,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647383529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:42,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:42,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:42,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:42,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638685041] [2022-04-28 15:18:42,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638685041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:42,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:42,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97616929] [2022-04-28 15:18:42,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:42,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:18:42,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:42,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:42,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:42,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:42,722 INFO L87 Difference]: Start difference. First operand 250 states and 383 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:44,746 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-28 15:18:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:45,738 INFO L93 Difference]: Finished difference Result 501 states and 771 transitions. [2022-04-28 15:18:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 15:18:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:18:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:18:45,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-28 15:18:46,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:46,036 INFO L225 Difference]: With dead ends: 501 [2022-04-28 15:18:46,036 INFO L226 Difference]: Without dead ends: 277 [2022-04-28 15:18:46,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:46,037 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 38 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:46,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 479 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 377 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:18:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-28 15:18:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 250. [2022-04-28 15:18:46,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:46,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:46,048 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:46,048 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:46,053 INFO L93 Difference]: Finished difference Result 277 states and 417 transitions. [2022-04-28 15:18:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 417 transitions. [2022-04-28 15:18:46,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:46,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:46,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 15:18:46,054 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 15:18:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:46,059 INFO L93 Difference]: Finished difference Result 277 states and 417 transitions. [2022-04-28 15:18:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 417 transitions. [2022-04-28 15:18:46,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:46,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:46,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:46,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.542857142857143) internal successors, (378), 245 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 382 transitions. [2022-04-28 15:18:46,064 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 382 transitions. Word has length 86 [2022-04-28 15:18:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:46,065 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 382 transitions. [2022-04-28 15:18:46,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:46,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 382 transitions. [2022-04-28 15:18:46,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 382 transitions. [2022-04-28 15:18:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:18:46,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:46,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:46,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:18:46,340 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 1 times [2022-04-28 15:18:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:46,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [640188226] [2022-04-28 15:18:46,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:46,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 2 times [2022-04-28 15:18:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:46,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894323719] [2022-04-28 15:18:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:46,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:46,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {27990#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {27983#true} is VALID [2022-04-28 15:18:46,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {27983#true} assume true; {27983#true} is VALID [2022-04-28 15:18:46,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27983#true} {27983#true} #661#return; {27983#true} is VALID [2022-04-28 15:18:46,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {27983#true} call ULTIMATE.init(); {27990#(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-28 15:18:46,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {27990#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {27983#true} assume true; {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27983#true} {27983#true} #661#return; {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {27983#true} call #t~ret161 := main(); {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {27983#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {27983#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L272 TraceCheckUtils]: 7: Hoare triple {27983#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {27983#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {27983#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {27983#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {27983#true} is VALID [2022-04-28 15:18:46,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {27983#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {27983#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {27983#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {27983#true} assume !false; {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {27983#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {27983#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {27983#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {27983#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {27983#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {27983#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {27983#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {27983#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {27983#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27983#true} is VALID [2022-04-28 15:18:46,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {27983#true} assume 8464 == #t~mem55;havoc #t~mem55; {27983#true} is VALID [2022-04-28 15:18:46,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {27983#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27983#true} is VALID [2022-04-28 15:18:46,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {27983#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27983#true} is VALID [2022-04-28 15:18:46,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {27983#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:46,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {27988#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27989#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {27989#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {27984#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {27984#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {27984#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {27984#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, 80 + ~s.offset, 8); {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {27984#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {27984#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {27984#false} assume 12292 != #t~mem85;havoc #t~mem85; {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {27984#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {27984#false} is VALID [2022-04-28 15:18:46,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {27984#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {27984#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {27984#false} ~skip~0 := 0; {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {27984#false} assume !false; {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {27984#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {27984#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {27984#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {27984#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {27984#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {27984#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {27984#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {27984#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {27984#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {27984#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 59: Hoare triple {27984#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {27984#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {27984#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {27984#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {27984#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,577 INFO L290 TraceCheckUtils]: 64: Hoare triple {27984#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 65: Hoare triple {27984#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 66: Hoare triple {27984#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 67: Hoare triple {27984#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 68: Hoare triple {27984#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 69: Hoare triple {27984#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {27984#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 71: Hoare triple {27984#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 72: Hoare triple {27984#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 73: Hoare triple {27984#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 74: Hoare triple {27984#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {27984#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 76: Hoare triple {27984#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 77: Hoare triple {27984#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 78: Hoare triple {27984#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 79: Hoare triple {27984#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 80: Hoare triple {27984#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 81: Hoare triple {27984#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 82: Hoare triple {27984#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 83: Hoare triple {27984#false} assume 8673 == #t~mem80;havoc #t~mem80; {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 84: Hoare triple {27984#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 85: Hoare triple {27984#false} assume 4 == ~blastFlag~0; {27984#false} is VALID [2022-04-28 15:18:46,579 INFO L290 TraceCheckUtils]: 86: Hoare triple {27984#false} assume !false; {27984#false} is VALID [2022-04-28 15:18:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:46,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894323719] [2022-04-28 15:18:46,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894323719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:46,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:46,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:46,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:46,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [640188226] [2022-04-28 15:18:46,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [640188226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:46,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:46,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960556064] [2022-04-28 15:18:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:46,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:18:46,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:46,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:46,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:46,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:46,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:46,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:46,649 INFO L87 Difference]: Start difference. First operand 250 states and 382 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:48,674 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-28 15:18:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:49,756 INFO L93 Difference]: Finished difference Result 584 states and 900 transitions. [2022-04-28 15:18:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:49,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:18:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 15:18:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-28 15:18:49,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-28 15:18:50,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:50,158 INFO L225 Difference]: With dead ends: 584 [2022-04-28 15:18:50,158 INFO L226 Difference]: Without dead ends: 360 [2022-04-28 15:18:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:50,159 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 137 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:18:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-28 15:18:50,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 252. [2022-04-28 15:18:50,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:50,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:50,170 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:50,171 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:50,177 INFO L93 Difference]: Finished difference Result 360 states and 544 transitions. [2022-04-28 15:18:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-04-28 15:18:50,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:50,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:50,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-28 15:18:50,179 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-28 15:18:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:50,186 INFO L93 Difference]: Finished difference Result 360 states and 544 transitions. [2022-04-28 15:18:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-04-28 15:18:50,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:50,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:50,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:50,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2022-04-28 15:18:50,201 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 87 [2022-04-28 15:18:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:50,201 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2022-04-28 15:18:50,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:50,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 382 transitions. [2022-04-28 15:18:50,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2022-04-28 15:18:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:18:50,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:50,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:50,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:18:50,490 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:50,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 1 times [2022-04-28 15:18:50,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:50,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2145615500] [2022-04-28 15:18:50,526 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:50,526 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 2 times [2022-04-28 15:18:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:50,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39188062] [2022-04-28 15:18:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:50,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {30394#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {30387#true} is VALID [2022-04-28 15:18:50,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {30387#true} assume true; {30387#true} is VALID [2022-04-28 15:18:50,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30387#true} {30387#true} #661#return; {30387#true} is VALID [2022-04-28 15:18:50,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {30387#true} call ULTIMATE.init(); {30394#(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-28 15:18:50,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {30394#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {30387#true} is VALID [2022-04-28 15:18:50,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {30387#true} assume true; {30387#true} is VALID [2022-04-28 15:18:50,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30387#true} {30387#true} #661#return; {30387#true} is VALID [2022-04-28 15:18:50,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {30387#true} call #t~ret161 := main(); {30387#true} is VALID [2022-04-28 15:18:50,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {30387#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30387#true} is VALID [2022-04-28 15:18:50,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {30387#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30387#true} is VALID [2022-04-28 15:18:50,641 INFO L272 TraceCheckUtils]: 7: Hoare triple {30387#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {30387#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {30387#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {30387#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {30387#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {30387#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {30387#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {30387#true} assume !false; {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {30387#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {30387#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {30387#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {30387#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {30387#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {30387#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {30387#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {30387#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {30387#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30387#true} is VALID [2022-04-28 15:18:50,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {30387#true} assume 8464 == #t~mem55;havoc #t~mem55; {30387#true} is VALID [2022-04-28 15:18:50,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {30387#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30387#true} is VALID [2022-04-28 15:18:50,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {30387#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30387#true} is VALID [2022-04-28 15:18:50,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {30387#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:50,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {30392#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30393#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 15:18:50,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {30393#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {30388#false} is VALID [2022-04-28 15:18:50,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {30388#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {30388#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {30388#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {30388#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, 80 + ~s.offset, 8); {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {30388#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {30388#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {30388#false} assume 12292 != #t~mem85;havoc #t~mem85; {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {30388#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {30388#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {30388#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {30388#false} ~skip~0 := 0; {30388#false} is VALID [2022-04-28 15:18:50,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {30388#false} assume !false; {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {30388#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {30388#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {30388#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 53: Hoare triple {30388#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 54: Hoare triple {30388#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 55: Hoare triple {30388#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 56: Hoare triple {30388#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {30388#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {30388#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,650 INFO L290 TraceCheckUtils]: 59: Hoare triple {30388#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {30388#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 61: Hoare triple {30388#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 62: Hoare triple {30388#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 63: Hoare triple {30388#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {30388#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 65: Hoare triple {30388#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {30388#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {30388#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {30388#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {30388#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {30388#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {30388#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 72: Hoare triple {30388#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 73: Hoare triple {30388#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 74: Hoare triple {30388#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 75: Hoare triple {30388#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {30388#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 77: Hoare triple {30388#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,652 INFO L290 TraceCheckUtils]: 78: Hoare triple {30388#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 79: Hoare triple {30388#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 80: Hoare triple {30388#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 81: Hoare triple {30388#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 82: Hoare triple {30388#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 83: Hoare triple {30388#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 84: Hoare triple {30388#false} assume 8673 == #t~mem80;havoc #t~mem80; {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 85: Hoare triple {30388#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 86: Hoare triple {30388#false} assume 4 == ~blastFlag~0; {30388#false} is VALID [2022-04-28 15:18:50,653 INFO L290 TraceCheckUtils]: 87: Hoare triple {30388#false} assume !false; {30388#false} is VALID [2022-04-28 15:18:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:18:50,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39188062] [2022-04-28 15:18:50,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39188062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:50,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:50,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:50,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2145615500] [2022-04-28 15:18:50,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2145615500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:50,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:50,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406277328] [2022-04-28 15:18:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:18:50,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:50,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:50,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:50,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:50,720 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:52,744 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-28 15:18:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:53,879 INFO L93 Difference]: Finished difference Result 586 states and 896 transitions. [2022-04-28 15:18:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:18:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-28 15:18:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-28 15:18:53,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 563 transitions. [2022-04-28 15:18:54,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 563 edges. 563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:54,276 INFO L225 Difference]: With dead ends: 586 [2022-04-28 15:18:54,276 INFO L226 Difference]: Without dead ends: 360 [2022-04-28 15:18:54,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:18:54,277 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 135 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:54,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 314 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-28 15:18:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 253. [2022-04-28 15:18:54,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:54,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:54,291 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:54,292 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:54,298 INFO L93 Difference]: Finished difference Result 360 states and 540 transitions. [2022-04-28 15:18:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 540 transitions. [2022-04-28 15:18:54,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:54,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:54,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 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 360 states. [2022-04-28 15:18:54,300 INFO L87 Difference]: Start difference. First operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 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 360 states. [2022-04-28 15:18:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:54,307 INFO L93 Difference]: Finished difference Result 360 states and 540 transitions. [2022-04-28 15:18:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 540 transitions. [2022-04-28 15:18:54,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:54,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:54,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:54,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 248 states have internal predecessors, (376), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 380 transitions. [2022-04-28 15:18:54,313 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 380 transitions. Word has length 88 [2022-04-28 15:18:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:54,313 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 380 transitions. [2022-04-28 15:18:54,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:54,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 380 transitions. [2022-04-28 15:18:54,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 380 transitions. [2022-04-28 15:18:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 15:18:54,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:54,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:54,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:18:54,601 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash 16034624, now seen corresponding path program 1 times [2022-04-28 15:18:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:54,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70394090] [2022-04-28 15:18:54,637 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:54,637 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash 16034624, now seen corresponding path program 2 times [2022-04-28 15:18:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:54,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732517297] [2022-04-28 15:18:54,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:54,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {32804#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {32797#true} is VALID [2022-04-28 15:18:54,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {32797#true} assume true; {32797#true} is VALID [2022-04-28 15:18:54,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32797#true} {32797#true} #661#return; {32797#true} is VALID [2022-04-28 15:18:54,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {32797#true} call ULTIMATE.init(); {32804#(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-28 15:18:54,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {32804#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {32797#true} is VALID [2022-04-28 15:18:54,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {32797#true} assume true; {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32797#true} {32797#true} #661#return; {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {32797#true} call #t~ret161 := main(); {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {32797#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {32797#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L272 TraceCheckUtils]: 7: Hoare triple {32797#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {32797#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {32797#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32797#true} is VALID [2022-04-28 15:18:54,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {32797#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {32797#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {32797#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {32797#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {32797#true} assume !false; {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {32797#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {32797#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {32797#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {32797#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {32797#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {32797#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {32797#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {32797#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {32797#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {32797#true} assume 8464 == #t~mem55;havoc #t~mem55; {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {32797#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {32797#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {32797#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {32797#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {32797#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32797#true} is VALID [2022-04-28 15:18:54,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {32797#true} ~skip~0 := 0; {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {32797#true} assume !false; {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {32797#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {32797#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {32797#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {32797#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {32797#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {32797#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {32797#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {32797#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {32797#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {32797#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {32797#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {32797#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {32797#true} assume 8496 == #t~mem58;havoc #t~mem58; {32797#true} is VALID [2022-04-28 15:18:54,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {32797#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {32797#true} is VALID [2022-04-28 15:18:54,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {32797#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {32797#true} is VALID [2022-04-28 15:18:54,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {32797#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {32797#true} is VALID [2022-04-28 15:18:54,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {32797#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,798 INFO L290 TraceCheckUtils]: 60: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,801 INFO L290 TraceCheckUtils]: 66: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,801 INFO L290 TraceCheckUtils]: 67: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,803 INFO L290 TraceCheckUtils]: 71: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,804 INFO L290 TraceCheckUtils]: 74: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,805 INFO L290 TraceCheckUtils]: 75: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,805 INFO L290 TraceCheckUtils]: 76: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,805 INFO L290 TraceCheckUtils]: 77: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,806 INFO L290 TraceCheckUtils]: 78: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,806 INFO L290 TraceCheckUtils]: 79: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,807 INFO L290 TraceCheckUtils]: 80: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,807 INFO L290 TraceCheckUtils]: 81: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,807 INFO L290 TraceCheckUtils]: 82: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,808 INFO L290 TraceCheckUtils]: 83: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:18:54,808 INFO L290 TraceCheckUtils]: 84: Hoare triple {32802#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {32803#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:18:54,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {32803#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {32798#false} is VALID [2022-04-28 15:18:54,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {32798#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {32798#false} is VALID [2022-04-28 15:18:54,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {32798#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {32798#false} is VALID [2022-04-28 15:18:54,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {32798#false} assume 8673 == #t~mem80;havoc #t~mem80; {32798#false} is VALID [2022-04-28 15:18:54,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {32798#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {32798#false} is VALID [2022-04-28 15:18:54,809 INFO L290 TraceCheckUtils]: 90: Hoare triple {32798#false} assume 4 == ~blastFlag~0; {32798#false} is VALID [2022-04-28 15:18:54,809 INFO L290 TraceCheckUtils]: 91: Hoare triple {32798#false} assume !false; {32798#false} is VALID [2022-04-28 15:18:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:18:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732517297] [2022-04-28 15:18:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732517297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:54,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:54,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:54,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70394090] [2022-04-28 15:18:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70394090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:54,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:54,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945744827] [2022-04-28 15:18:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:54,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:18:54,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:54,811 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-28 15:18:54,878 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-28 15:18:54,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:54,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:54,879 INFO L87 Difference]: Start difference. First operand 253 states and 380 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-28 15:18:56,903 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-28 15:18:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:58,095 INFO L93 Difference]: Finished difference Result 584 states and 885 transitions. [2022-04-28 15:18:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:18:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:18:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:18:58,096 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-28 15:18:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-28 15:18:58,098 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-28 15:18:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-28 15:18:58,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 535 transitions. [2022-04-28 15:18:58,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:58,464 INFO L225 Difference]: With dead ends: 584 [2022-04-28 15:18:58,464 INFO L226 Difference]: Without dead ends: 357 [2022-04-28 15:18:58,465 INFO L412 NwaCegarLoop]: 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-28 15:18:58,465 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 73 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:18:58,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 469 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:18:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-28 15:18:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 296. [2022-04-28 15:18:58,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:18:58,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:58,479 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:58,480 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:58,486 INFO L93 Difference]: Finished difference Result 357 states and 534 transitions. [2022-04-28 15:18:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 534 transitions. [2022-04-28 15:18:58,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:58,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:58,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 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 357 states. [2022-04-28 15:18:58,488 INFO L87 Difference]: Start difference. First operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 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 357 states. [2022-04-28 15:18:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:18:58,494 INFO L93 Difference]: Finished difference Result 357 states and 534 transitions. [2022-04-28 15:18:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 534 transitions. [2022-04-28 15:18:58,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:18:58,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:18:58,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:18:58,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:18:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.5498281786941581) internal successors, (451), 291 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:18:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 455 transitions. [2022-04-28 15:18:58,502 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 455 transitions. Word has length 92 [2022-04-28 15:18:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:18:58,502 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 455 transitions. [2022-04-28 15:18:58,502 INFO L496 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-28 15:18:58,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 455 transitions. [2022-04-28 15:18:58,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:18:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 455 transitions. [2022-04-28 15:18:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 15:18:58,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:18:58,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:18:58,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:18:58,909 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:18:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:18:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2033353218, now seen corresponding path program 1 times [2022-04-28 15:18:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:58,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498029033] [2022-04-28 15:18:58,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:18:58,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:18:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2033353218, now seen corresponding path program 2 times [2022-04-28 15:18:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:18:58,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011942031] [2022-04-28 15:18:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:18:58,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:18:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:18:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:18:59,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {35290#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {35283#true} is VALID [2022-04-28 15:18:59,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {35283#true} assume true; {35283#true} is VALID [2022-04-28 15:18:59,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35283#true} {35283#true} #661#return; {35283#true} is VALID [2022-04-28 15:18:59,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {35283#true} call ULTIMATE.init(); {35290#(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-28 15:18:59,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {35290#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {35283#true} assume true; {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35283#true} {35283#true} #661#return; {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {35283#true} call #t~ret161 := main(); {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {35283#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {35283#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L272 TraceCheckUtils]: 7: Hoare triple {35283#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {35283#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {35283#true} is VALID [2022-04-28 15:18:59,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {35283#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {35283#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {35283#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {35283#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {35283#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {35283#true} assume !false; {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {35283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {35283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {35283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {35283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {35283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {35283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {35283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {35283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {35283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {35283#true} assume 8464 == #t~mem55;havoc #t~mem55; {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {35283#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {35283#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {35283#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {35283#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {35283#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35283#true} is VALID [2022-04-28 15:18:59,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {35283#true} ~skip~0 := 0; {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {35283#true} assume !false; {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {35283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {35283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {35283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {35283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {35283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {35283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {35283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {35283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {35283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {35283#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {35283#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {35283#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {35283#true} assume 8496 == #t~mem58;havoc #t~mem58; {35283#true} is VALID [2022-04-28 15:18:59,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {35283#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35283#true} is VALID [2022-04-28 15:18:59,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {35283#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35283#true} is VALID [2022-04-28 15:18:59,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {35283#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {35283#true} is VALID [2022-04-28 15:18:59,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {35283#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,138 INFO L290 TraceCheckUtils]: 74: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,141 INFO L290 TraceCheckUtils]: 82: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,142 INFO L290 TraceCheckUtils]: 83: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,142 INFO L290 TraceCheckUtils]: 84: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,142 INFO L290 TraceCheckUtils]: 85: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:18:59,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {35288#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {35289#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-28 15:18:59,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {35289#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {35284#false} is VALID [2022-04-28 15:18:59,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {35284#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {35284#false} is VALID [2022-04-28 15:18:59,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {35284#false} assume 4 == ~blastFlag~0; {35284#false} is VALID [2022-04-28 15:18:59,144 INFO L290 TraceCheckUtils]: 91: Hoare triple {35284#false} assume !false; {35284#false} is VALID [2022-04-28 15:18:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:18:59,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:18:59,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011942031] [2022-04-28 15:18:59,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011942031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:59,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:59,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:59,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:18:59,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498029033] [2022-04-28 15:18:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498029033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:18:59,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:18:59,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:18:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528197376] [2022-04-28 15:18:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:18:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:18:59,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:18:59,147 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-28 15:18:59,214 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-28 15:18:59,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:18:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:18:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:18:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:18:59,216 INFO L87 Difference]: Start difference. First operand 296 states and 455 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-28 15:19:01,242 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-28 15:19:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:02,360 INFO L93 Difference]: Finished difference Result 673 states and 1040 transitions. [2022-04-28 15:19:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 15:19:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:02,360 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-28 15:19:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-28 15:19:02,363 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-28 15:19:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-28 15:19:02,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-28 15:19:02,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:02,748 INFO L225 Difference]: With dead ends: 673 [2022-04-28 15:19:02,748 INFO L226 Difference]: Without dead ends: 401 [2022-04-28 15:19:02,749 INFO L412 NwaCegarLoop]: 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-28 15:19:02,749 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 106 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:02,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 324 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:19:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-28 15:19:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 323. [2022-04-28 15:19:02,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:02,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:02,765 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:02,765 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:02,773 INFO L93 Difference]: Finished difference Result 401 states and 611 transitions. [2022-04-28 15:19:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 611 transitions. [2022-04-28 15:19:02,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:02,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:02,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 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 401 states. [2022-04-28 15:19:02,775 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 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 401 states. [2022-04-28 15:19:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:02,784 INFO L93 Difference]: Finished difference Result 401 states and 611 transitions. [2022-04-28 15:19:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 611 transitions. [2022-04-28 15:19:02,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:02,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:02,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:02,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.5849056603773586) internal successors, (504), 318 states have internal predecessors, (504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 508 transitions. [2022-04-28 15:19:02,792 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 508 transitions. Word has length 92 [2022-04-28 15:19:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:02,792 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 508 transitions. [2022-04-28 15:19:02,792 INFO L496 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-28 15:19:02,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 323 states and 508 transitions. [2022-04-28 15:19:03,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 508 transitions. [2022-04-28 15:19:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-28 15:19:03,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:03,254 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:19:03,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:19:03,260 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:03,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash -70912791, now seen corresponding path program 1 times [2022-04-28 15:19:03,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:03,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312258247] [2022-04-28 15:19:03,317 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:19:03,317 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -70912791, now seen corresponding path program 2 times [2022-04-28 15:19:03,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:03,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403947155] [2022-04-28 15:19:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:03,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {38096#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {38089#true} is VALID [2022-04-28 15:19:03,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-04-28 15:19:03,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38089#true} {38089#true} #661#return; {38089#true} is VALID [2022-04-28 15:19:03,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {38089#true} call ULTIMATE.init(); {38096#(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-28 15:19:03,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {38096#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {38089#true} assume true; {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38089#true} {38089#true} #661#return; {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {38089#true} call #t~ret161 := main(); {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {38089#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {38089#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L272 TraceCheckUtils]: 7: Hoare triple {38089#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {38089#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {38089#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {38089#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {38089#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38089#true} is VALID [2022-04-28 15:19:03,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {38089#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {38089#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {38089#true} assume !false; {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {38089#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {38089#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {38089#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {38089#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {38089#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {38089#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {38089#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {38089#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {38089#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {38089#true} assume 8464 == #t~mem55;havoc #t~mem55; {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {38089#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {38089#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {38089#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {38089#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {38089#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {38089#true} ~skip~0 := 0; {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {38089#true} assume !false; {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {38089#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {38089#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {38089#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {38089#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {38089#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {38089#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {38089#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {38089#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {38089#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {38089#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {38089#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {38089#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {38089#true} assume 8496 == #t~mem58;havoc #t~mem58; {38089#true} is VALID [2022-04-28 15:19:03,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {38089#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {38089#true} is VALID [2022-04-28 15:19:03,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {38089#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38089#true} is VALID [2022-04-28 15:19:03,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {38089#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {38089#true} is VALID [2022-04-28 15:19:03,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {38089#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,465 INFO L290 TraceCheckUtils]: 63: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,465 INFO L290 TraceCheckUtils]: 64: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,470 INFO L290 TraceCheckUtils]: 74: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:03,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {38094#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {38095#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 15:19:03,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {38095#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {38090#false} is VALID [2022-04-28 15:19:03,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {38090#false} assume !(~num1~0 > 0); {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {38090#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {38090#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {38090#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {38090#false} ~skip~0 := 0; {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {38090#false} assume !false; {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 83: Hoare triple {38090#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 84: Hoare triple {38090#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 85: Hoare triple {38090#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 86: Hoare triple {38090#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,471 INFO L290 TraceCheckUtils]: 87: Hoare triple {38090#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 88: Hoare triple {38090#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 89: Hoare triple {38090#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 90: Hoare triple {38090#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 91: Hoare triple {38090#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {38090#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {38090#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 94: Hoare triple {38090#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {38090#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 96: Hoare triple {38090#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {38090#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 98: Hoare triple {38090#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 99: Hoare triple {38090#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 100: Hoare triple {38090#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {38090#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 102: Hoare triple {38090#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 103: Hoare triple {38090#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 104: Hoare triple {38090#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 105: Hoare triple {38090#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 106: Hoare triple {38090#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 107: Hoare triple {38090#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,473 INFO L290 TraceCheckUtils]: 108: Hoare triple {38090#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 109: Hoare triple {38090#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 110: Hoare triple {38090#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 111: Hoare triple {38090#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 112: Hoare triple {38090#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 113: Hoare triple {38090#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 114: Hoare triple {38090#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 115: Hoare triple {38090#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 116: Hoare triple {38090#false} assume 8672 == #t~mem79;havoc #t~mem79; {38090#false} is VALID [2022-04-28 15:19:03,474 INFO L290 TraceCheckUtils]: 117: Hoare triple {38090#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {38090#false} is VALID [2022-04-28 15:19:03,475 INFO L290 TraceCheckUtils]: 118: Hoare triple {38090#false} assume 4 == ~blastFlag~0; {38090#false} is VALID [2022-04-28 15:19:03,475 INFO L290 TraceCheckUtils]: 119: Hoare triple {38090#false} assume !false; {38090#false} is VALID [2022-04-28 15:19:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:19:03,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:03,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403947155] [2022-04-28 15:19:03,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403947155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:03,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:03,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:03,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:03,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312258247] [2022-04-28 15:19:03,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312258247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:03,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:03,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635912485] [2022-04-28 15:19:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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 120 [2022-04-28 15:19:03,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:03,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:03,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:03,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:03,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:03,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:03,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:03,571 INFO L87 Difference]: Start difference. First operand 323 states and 508 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:05,594 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-28 15:19:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:06,703 INFO L93 Difference]: Finished difference Result 737 states and 1160 transitions. [2022-04-28 15:19:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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 120 [2022-04-28 15:19:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2022-04-28 15:19:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2022-04-28 15:19:06,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 556 transitions. [2022-04-28 15:19:07,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:07,100 INFO L225 Difference]: With dead ends: 737 [2022-04-28 15:19:07,100 INFO L226 Difference]: Without dead ends: 440 [2022-04-28 15:19:07,100 INFO L412 NwaCegarLoop]: 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-28 15:19:07,101 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:07,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 340 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:19:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-28 15:19:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 355. [2022-04-28 15:19:07,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:07,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:07,118 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:07,119 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:07,129 INFO L93 Difference]: Finished difference Result 440 states and 679 transitions. [2022-04-28 15:19:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 679 transitions. [2022-04-28 15:19:07,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:07,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:07,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 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 440 states. [2022-04-28 15:19:07,131 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 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 440 states. [2022-04-28 15:19:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:07,141 INFO L93 Difference]: Finished difference Result 440 states and 679 transitions. [2022-04-28 15:19:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 679 transitions. [2022-04-28 15:19:07,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:07,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:07,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:07,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5914285714285714) internal successors, (557), 350 states have internal predecessors, (557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 561 transitions. [2022-04-28 15:19:07,151 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 561 transitions. Word has length 120 [2022-04-28 15:19:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:07,151 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 561 transitions. [2022-04-28 15:19:07,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:07,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 561 transitions. [2022-04-28 15:19:07,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 561 edges. 561 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 561 transitions. [2022-04-28 15:19:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 15:19:07,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:07,585 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:19:07,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:19:07,586 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1899791356, now seen corresponding path program 1 times [2022-04-28 15:19:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:07,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193144743] [2022-04-28 15:19:07,669 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:19:07,669 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1899791356, now seen corresponding path program 2 times [2022-04-28 15:19:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:07,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137031914] [2022-04-28 15:19:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:07,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:07,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {41172#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {41165#true} is VALID [2022-04-28 15:19:07,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {41165#true} assume true; {41165#true} is VALID [2022-04-28 15:19:07,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41165#true} {41165#true} #661#return; {41165#true} is VALID [2022-04-28 15:19:07,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {41165#true} call ULTIMATE.init(); {41172#(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-28 15:19:07,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {41172#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {41165#true} is VALID [2022-04-28 15:19:07,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {41165#true} assume true; {41165#true} is VALID [2022-04-28 15:19:07,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41165#true} {41165#true} #661#return; {41165#true} is VALID [2022-04-28 15:19:07,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {41165#true} call #t~ret161 := main(); {41165#true} is VALID [2022-04-28 15:19:07,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {41165#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {41165#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L272 TraceCheckUtils]: 7: Hoare triple {41165#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {41165#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {41165#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {41165#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {41165#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {41165#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {41165#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {41165#true} assume !false; {41165#true} is VALID [2022-04-28 15:19:07,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {41165#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {41165#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {41165#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {41165#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {41165#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {41165#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {41165#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {41165#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {41165#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {41165#true} assume 8464 == #t~mem55;havoc #t~mem55; {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {41165#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {41165#true} is VALID [2022-04-28 15:19:07,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {41165#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {41165#true} is VALID [2022-04-28 15:19:07,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {41165#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:07,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:07,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:07,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:07,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {41170#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41171#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {41171#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {41166#false} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {41166#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {41166#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {41166#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {41166#false} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {41166#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {41166#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, 80 + ~s.offset, 8); {41166#false} is VALID [2022-04-28 15:19:07,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {41166#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {41166#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {41166#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {41166#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {41166#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {41166#false} ~skip~0 := 0; {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {41166#false} assume !false; {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {41166#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {41166#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {41166#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {41166#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {41166#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {41166#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {41166#false} assume 8480 == #t~mem52;havoc #t~mem52; {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {41166#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {41166#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {41166#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {41166#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {41166#false} ~skip~0 := 0; {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {41166#false} assume !false; {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {41166#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {41166#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {41166#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {41166#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {41166#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {41166#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {41166#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {41166#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {41166#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {41166#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {41166#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {41166#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {41166#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {41166#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {41166#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {41166#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {41166#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {41166#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {41166#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {41166#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {41166#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {41166#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 81: Hoare triple {41166#false} assume 8448 == #t~mem68;havoc #t~mem68; {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {41166#false} assume !(~num1~0 > 0); {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 83: Hoare triple {41166#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 84: Hoare triple {41166#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 85: Hoare triple {41166#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {41166#false} ~skip~0 := 0; {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {41166#false} assume !false; {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {41166#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {41166#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 90: Hoare triple {41166#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,814 INFO L290 TraceCheckUtils]: 91: Hoare triple {41166#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 92: Hoare triple {41166#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 93: Hoare triple {41166#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 94: Hoare triple {41166#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 95: Hoare triple {41166#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 96: Hoare triple {41166#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 97: Hoare triple {41166#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 98: Hoare triple {41166#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 99: Hoare triple {41166#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 100: Hoare triple {41166#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,815 INFO L290 TraceCheckUtils]: 101: Hoare triple {41166#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 102: Hoare triple {41166#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 103: Hoare triple {41166#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 104: Hoare triple {41166#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 105: Hoare triple {41166#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 106: Hoare triple {41166#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 107: Hoare triple {41166#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 108: Hoare triple {41166#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 109: Hoare triple {41166#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 110: Hoare triple {41166#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 111: Hoare triple {41166#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,816 INFO L290 TraceCheckUtils]: 112: Hoare triple {41166#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 113: Hoare triple {41166#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 114: Hoare triple {41166#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 115: Hoare triple {41166#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 116: Hoare triple {41166#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 117: Hoare triple {41166#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 118: Hoare triple {41166#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 119: Hoare triple {41166#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 120: Hoare triple {41166#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 121: Hoare triple {41166#false} assume 8672 == #t~mem79;havoc #t~mem79; {41166#false} is VALID [2022-04-28 15:19:07,817 INFO L290 TraceCheckUtils]: 122: Hoare triple {41166#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {41166#false} is VALID [2022-04-28 15:19:07,818 INFO L290 TraceCheckUtils]: 123: Hoare triple {41166#false} assume 4 == ~blastFlag~0; {41166#false} is VALID [2022-04-28 15:19:07,818 INFO L290 TraceCheckUtils]: 124: Hoare triple {41166#false} assume !false; {41166#false} is VALID [2022-04-28 15:19:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 15:19:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:07,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137031914] [2022-04-28 15:19:07,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137031914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:07,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:07,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:07,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:07,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193144743] [2022-04-28 15:19:07,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193144743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:07,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:07,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701229838] [2022-04-28 15:19:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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 125 [2022-04-28 15:19:07,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:07,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:07,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:07,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:07,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:07,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:07,889 INFO L87 Difference]: Start difference. First operand 355 states and 561 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:09,913 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-28 15:19:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:10,848 INFO L93 Difference]: Finished difference Result 691 states and 1102 transitions. [2022-04-28 15:19:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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 125 [2022-04-28 15:19:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 15:19:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2022-04-28 15:19:10,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 432 transitions. [2022-04-28 15:19:11,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:11,149 INFO L225 Difference]: With dead ends: 691 [2022-04-28 15:19:11,149 INFO L226 Difference]: Without dead ends: 362 [2022-04-28 15:19:11,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:19:11,150 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 30 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:11,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 495 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:19:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-28 15:19:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 355. [2022-04-28 15:19:11,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:11,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:11,168 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:11,168 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:11,175 INFO L93 Difference]: Finished difference Result 362 states and 570 transitions. [2022-04-28 15:19:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 570 transitions. [2022-04-28 15:19:11,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:11,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:11,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 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 362 states. [2022-04-28 15:19:11,177 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 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 362 states. [2022-04-28 15:19:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:11,183 INFO L93 Difference]: Finished difference Result 362 states and 570 transitions. [2022-04-28 15:19:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 570 transitions. [2022-04-28 15:19:11,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:11,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:11,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:11,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5885714285714285) internal successors, (556), 350 states have internal predecessors, (556), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 560 transitions. [2022-04-28 15:19:11,193 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 560 transitions. Word has length 125 [2022-04-28 15:19:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:11,193 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 560 transitions. [2022-04-28 15:19:11,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:11,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 560 transitions. [2022-04-28 15:19:11,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 560 transitions. [2022-04-28 15:19:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:19:11,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:11,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:19:11,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:19:11,645 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash 716472108, now seen corresponding path program 1 times [2022-04-28 15:19:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:11,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25860992] [2022-04-28 15:19:11,730 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:19:11,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash 716472108, now seen corresponding path program 2 times [2022-04-28 15:19:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:11,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372903478] [2022-04-28 15:19:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:12,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {44002#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {43993#true} is VALID [2022-04-28 15:19:12,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {43993#true} assume true; {43993#true} is VALID [2022-04-28 15:19:12,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43993#true} {43993#true} #661#return; {43993#true} is VALID [2022-04-28 15:19:12,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {43993#true} call ULTIMATE.init(); {44002#(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-28 15:19:12,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {44002#(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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$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); {43993#true} is VALID [2022-04-28 15:19:12,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {43993#true} assume true; {43993#true} is VALID [2022-04-28 15:19:12,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43993#true} {43993#true} #661#return; {43993#true} is VALID [2022-04-28 15:19:12,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {43993#true} call #t~ret161 := main(); {43993#true} is VALID [2022-04-28 15:19:12,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {43993#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(8464, ~s~0.base, 72 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {43993#true} is VALID [2022-04-28 15:19:12,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {43993#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {43998#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:19:12,222 INFO L272 TraceCheckUtils]: 7: Hoare triple {43998#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {43999#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:19:12,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {43999#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:19:12,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:19:12,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:19:12,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:19:12,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {44000#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {44001#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:19:12,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {44001#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {43994#false} is VALID [2022-04-28 15:19:12,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {43994#false} assume !false; {43994#false} is VALID [2022-04-28 15:19:12,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {43994#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {43994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {43994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {43994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {43994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {43994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {43994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {43994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {43994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {43994#false} assume 8464 == #t~mem55;havoc #t~mem55; {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {43994#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {43994#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43994#false} is VALID [2022-04-28 15:19:12,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {43994#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {43994#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {43994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {43994#false} ~skip~0 := 0; {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {43994#false} assume !false; {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {43994#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {43994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {43994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {43994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {43994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {43994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {43994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {43994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {43994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {43994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {43994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {43994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {43994#false} assume 8496 == #t~mem58;havoc #t~mem58; {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {43994#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {43994#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {43994#false} is VALID [2022-04-28 15:19:12,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {43994#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {43994#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {43994#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {43994#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {43994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {43994#false} ~skip~0 := 0; {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {43994#false} assume !false; {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {43994#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {43994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {43994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {43994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {43994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {43994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {43994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {43994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {43994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {43994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {43994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {43994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 66: Hoare triple {43994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {43994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {43994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {43994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 70: Hoare triple {43994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {43994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {43994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {43994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {43994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {43994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {43994#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {43994#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {43994#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,234 INFO L290 TraceCheckUtils]: 79: Hoare triple {43994#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {43994#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 81: Hoare triple {43994#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 82: Hoare triple {43994#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 83: Hoare triple {43994#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 84: Hoare triple {43994#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {43994#false} assume 8656 == #t~mem77;havoc #t~mem77; {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 86: Hoare triple {43994#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {43994#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {43994#false} is VALID [2022-04-28 15:19:12,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {43994#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 4; {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 89: Hoare triple {43994#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 90: Hoare triple {43994#false} assume !(0 == ~tmp___10~0); {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 91: Hoare triple {43994#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 92: Hoare triple {43994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 93: Hoare triple {43994#false} ~skip~0 := 0; {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 94: Hoare triple {43994#false} assume !false; {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 95: Hoare triple {43994#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {43994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {43994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,236 INFO L290 TraceCheckUtils]: 98: Hoare triple {43994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 99: Hoare triple {43994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 100: Hoare triple {43994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 101: Hoare triple {43994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 102: Hoare triple {43994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 103: Hoare triple {43994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 104: Hoare triple {43994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 105: Hoare triple {43994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 106: Hoare triple {43994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 107: Hoare triple {43994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 108: Hoare triple {43994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,237 INFO L290 TraceCheckUtils]: 109: Hoare triple {43994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 110: Hoare triple {43994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 111: Hoare triple {43994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 112: Hoare triple {43994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 113: Hoare triple {43994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 114: Hoare triple {43994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 115: Hoare triple {43994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 116: Hoare triple {43994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 117: Hoare triple {43994#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 118: Hoare triple {43994#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,238 INFO L290 TraceCheckUtils]: 119: Hoare triple {43994#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 120: Hoare triple {43994#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 121: Hoare triple {43994#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 122: Hoare triple {43994#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 123: Hoare triple {43994#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 124: Hoare triple {43994#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 125: Hoare triple {43994#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 126: Hoare triple {43994#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 127: Hoare triple {43994#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 128: Hoare triple {43994#false} assume 8672 == #t~mem79;havoc #t~mem79; {43994#false} is VALID [2022-04-28 15:19:12,239 INFO L290 TraceCheckUtils]: 129: Hoare triple {43994#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {43994#false} is VALID [2022-04-28 15:19:12,240 INFO L290 TraceCheckUtils]: 130: Hoare triple {43994#false} assume 4 == ~blastFlag~0; {43994#false} is VALID [2022-04-28 15:19:12,240 INFO L290 TraceCheckUtils]: 131: Hoare triple {43994#false} assume !false; {43994#false} is VALID [2022-04-28 15:19:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-28 15:19:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:12,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372903478] [2022-04-28 15:19:12,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372903478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:12,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:12,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:19:12,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [25860992] [2022-04-28 15:19:12,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [25860992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:12,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:12,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:19:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673525024] [2022-04-28 15:19:12,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 15:19:12,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:12,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:12,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:12,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:19:12,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:19:12,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:19:12,306 INFO L87 Difference]: Start difference. First operand 355 states and 560 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:14,340 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-28 15:19:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:15,645 INFO L93 Difference]: Finished difference Result 703 states and 1112 transitions. [2022-04-28 15:19:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:19:15,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-28 15:19:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-28 15:19:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-28 15:19:15,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 402 transitions. [2022-04-28 15:19:15,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:15,913 INFO L225 Difference]: With dead ends: 703 [2022-04-28 15:19:15,913 INFO L226 Difference]: Without dead ends: 355 [2022-04-28 15:19:15,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 15:19:15,914 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:15,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:19:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-28 15:19:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-04-28 15:19:15,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:15,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:15,931 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:15,932 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:15,938 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-28 15:19:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:19:15,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:15,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:15,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 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 355 states. [2022-04-28 15:19:15,940 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 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 355 states. [2022-04-28 15:19:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:15,946 INFO L93 Difference]: Finished difference Result 355 states and 559 transitions. [2022-04-28 15:19:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:19:15,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:15,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:15,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:15,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.5857142857142856) internal successors, (555), 350 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 559 transitions. [2022-04-28 15:19:15,956 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 559 transitions. Word has length 132 [2022-04-28 15:19:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:15,957 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 559 transitions. [2022-04-28 15:19:15,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:19:15,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 559 transitions. [2022-04-28 15:19:16,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:19:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 559 transitions. [2022-04-28 15:19:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 15:19:16,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:16,465 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:19:16,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:19:16,466 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash 286813802, now seen corresponding path program 1 times [2022-04-28 15:19:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:16,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229032814] [2022-04-28 15:19:16,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:19:16,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash 286813802, now seen corresponding path program 2 times [2022-04-28 15:19:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:16,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514973031] [2022-04-28 15:19:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:19:17,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 15:19:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 15:19:17,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 15:19:17,384 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 15:19:17,384 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 15:19:17,389 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:19:17,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:19:17,393 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 15:19:17,396 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:19:17,434 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:19:17,434 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-28 15:19:17,434 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 15:19:17,434 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:19:17,434 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 15:19:17,434 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 15:19:17,434 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:19:17,435 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1743-1 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-28 15:19:17,436 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-28 15:19:17,437 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1723 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1727-2 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:19:17,438 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-28 15:19:17,439 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1654 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-28 15:19:17,440 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1692-1 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-28 15:19:17,441 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1383-2 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1392-2 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1408-2 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:19:17,442 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1430 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1419-1 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:19:17,443 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1474 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1506-1 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-28 15:19:17,444 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1572 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1572 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1572-2 has no Hoare annotation [2022-04-28 15:19:17,445 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1582 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1589 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1589 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1592-2 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1592 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-28 15:19:17,446 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-28 15:19:17,447 WARN L170 areAnnotationChecker]: L1636-1 has no Hoare annotation [2022-04-28 15:19:17,447 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 15:19:17,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:19:17 BoogieIcfgContainer [2022-04-28 15:19:17,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:19:17,449 INFO L158 Benchmark]: Toolchain (without parser) took 113514.51ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 128.9MB in the beginning and 153.6MB in the end (delta: -24.7MB). Peak memory consumption was 112.5MB. Max. memory is 8.0GB. [2022-04-28 15:19:17,449 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 177.2MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:19:17,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.83ms. Allocated memory is still 177.2MB. Free memory was 128.6MB in the beginning and 132.6MB in the end (delta: -4.0MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-04-28 15:19:17,450 INFO L158 Benchmark]: Boogie Preprocessor took 159.82ms. Allocated memory is still 177.2MB. Free memory was 132.6MB in the beginning and 122.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:19:17,450 INFO L158 Benchmark]: RCFGBuilder took 2394.68ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 122.8MB in the beginning and 123.1MB in the end (delta: -272.7kB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. [2022-04-28 15:19:17,450 INFO L158 Benchmark]: TraceAbstraction took 110406.27ms. Allocated memory is still 212.9MB. Free memory was 122.6MB in the beginning and 154.1MB in the end (delta: -31.6MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2022-04-28 15:19:17,451 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.16ms. Allocated memory is still 177.2MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.83ms. Allocated memory is still 177.2MB. Free memory was 128.6MB in the beginning and 132.6MB in the end (delta: -4.0MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 159.82ms. Allocated memory is still 177.2MB. Free memory was 132.6MB in the beginning and 122.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 2394.68ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 122.8MB in the beginning and 123.1MB in the end (delta: -272.7kB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. * TraceAbstraction took 110406.27ms. Allocated memory is still 212.9MB. Free memory was 122.6MB in the beginning and 154.1MB in the end (delta: -31.6MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1733]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) [L1161] EXPR s->cert [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 [L1378] COND FALSE !(ret <= 0) [L1383] s->hit [L1383] COND TRUE s->hit [L1384] s->state = 8656 [L1388] s->init_num = 0 [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state [L1260] COND TRUE s->state == 8656 [L1581] EXPR s->session [L1581] EXPR s->s3 [L1581] EXPR (s->s3)->tmp.new_cipher [L1581] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1582] COND FALSE !(! tmp___9) [L1588] ret = __VERIFIER_nondet_int() [L1589] COND TRUE blastFlag == 2 [L1590] blastFlag = 4 [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 [L1605] COND FALSE !(! tmp___10) [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 [L1167] COND TRUE 1 [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 4 [L1733] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 110.3s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 93.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 1261 SdHoareTripleChecker+Valid, 65.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1261 mSDsluCounter, 11453 SdHoareTripleChecker+Invalid, 65.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7201 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9961 IncrementalHoareTripleChecker+Invalid, 10520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 4252 mSDtfsCounter, 9961 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=23, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 867 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-28 15:19:17,480 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...