/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:43:52,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:43:52,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:43:52,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:43:52,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:43:52,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:43:52,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:43:52,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:43:52,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:43:52,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:43:52,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:43:52,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:43:52,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:43:52,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:43:52,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:43:52,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:43:52,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:43:52,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:43:52,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:43:52,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:43:52,845 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:43:52,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:43:52,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:43:52,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:43:52,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:43:52,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:43:52,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:43:52,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:43:52,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:43:52,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:43:52,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:43:52,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:43:52,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:43:52,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:43:52,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:43:52,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:43:52,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:43:52,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:43:52,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:43:52,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:43:52,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:43:52,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:43:52,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:43:52,868 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:43:52,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:43:52,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:43:52,869 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:43:52,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:43:52,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:43:52,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:43:52,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:43:52,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:43:52,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:43:52,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:43:52,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:43:52,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:43:52,872 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:43:52,872 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:43:52,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:43:52,872 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:43:52,872 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:43:53,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:43:53,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:43:53,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:43:53,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:43:53,101 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:43:53,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-2.c [2022-04-08 08:43:53,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25ab604f/c553fb1b2e19424babd1b5ed31ee866c/FLAG8f2c400b1 [2022-04-08 08:43:53,638 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:43:53,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-2.c [2022-04-08 08:43:53,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25ab604f/c553fb1b2e19424babd1b5ed31ee866c/FLAG8f2c400b1 [2022-04-08 08:43:53,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25ab604f/c553fb1b2e19424babd1b5ed31ee866c [2022-04-08 08:43:53,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:43:53,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:43:53,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:43:53,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:43:53,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:43:53,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:43:53" (1/1) ... [2022-04-08 08:43:53,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5f44c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:53, skipping insertion in model container [2022-04-08 08:43:53,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:43:53" (1/1) ... [2022-04-08 08:43:53,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:43:53,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:43:53,987 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.12.i.cil-2.c[75436,75449] [2022-04-08 08:43:53,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:43:54,002 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:43:54,122 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.12.i.cil-2.c[75436,75449] [2022-04-08 08:43:54,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:43:54,139 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:43:54,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54 WrapperNode [2022-04-08 08:43:54,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:43:54,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:43:54,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:43:54,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:43:54,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:43:54,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:43:54,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:43:54,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:43:54,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (1/1) ... [2022-04-08 08:43:54,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:43:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:43:54,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:43:54,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:43:54,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:43:54,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:43:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:43:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 08:43:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 08:43:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:43:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:43:54,326 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:43:54,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:43:54,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:43:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:43:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:43:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:43:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:43:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:43:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:43:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:43:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:43:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:43:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:43:54,451 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:43:54,452 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:43:55,217 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:43:55,627 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 08:43:55,628 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 08:43:55,645 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:43:55,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:43:55,653 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:43:55,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:43:55 BoogieIcfgContainer [2022-04-08 08:43:55,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:43:55,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:43:55,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:43:55,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:43:55,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:43:53" (1/3) ... [2022-04-08 08:43:55,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f77d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:43:55, skipping insertion in model container [2022-04-08 08:43:55,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:43:54" (2/3) ... [2022-04-08 08:43:55,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f77d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:43:55, skipping insertion in model container [2022-04-08 08:43:55,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:43:55" (3/3) ... [2022-04-08 08:43:55,661 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2022-04-08 08:43:55,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:43:55,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:43:55,697 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:43:55,708 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:43:55,708 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:43:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 154 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:43:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 08:43:55,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:55,737 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:55,737 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1074581461, now seen corresponding path program 1 times [2022-04-08 08:43:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:55,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [757003456] [2022-04-08 08:43:55,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:43:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1074581461, now seen corresponding path program 2 times [2022-04-08 08:43:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:55,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224849060] [2022-04-08 08:43:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:56,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {164#true} is VALID [2022-04-08 08:43:56,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-08 08:43:56,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164#true} {164#true} #710#return; {164#true} is VALID [2022-04-08 08:43:56,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {164#true} call ULTIMATE.init(); {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:43:56,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {164#true} is VALID [2022-04-08 08:43:56,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-08 08:43:56,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} #710#return; {164#true} is VALID [2022-04-08 08:43:56,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} call #t~ret161 := main(); {164#true} is VALID [2022-04-08 08:43:56,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {164#true} is VALID [2022-04-08 08:43:56,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {164#true} is VALID [2022-04-08 08:43:56,193 INFO L272 TraceCheckUtils]: 7: Hoare triple {164#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {164#true} is VALID [2022-04-08 08:43:56,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:43:56,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {169#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {170#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 08:43:56,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {170#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {165#false} is VALID [2022-04-08 08:43:56,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {165#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {165#false} is VALID [2022-04-08 08:43:56,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#false} assume !(9 == ~blastFlag~0); {165#false} is VALID [2022-04-08 08:43:56,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#false} assume 12 == ~blastFlag~0; {165#false} is VALID [2022-04-08 08:43:56,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-04-08 08:43:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:43:56,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:56,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224849060] [2022-04-08 08:43:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224849060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:56,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:56,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:56,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:56,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [757003456] [2022-04-08 08:43:56,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [757003456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:56,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:56,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:56,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743009171] [2022-04-08 08:43:56,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:43:56,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:56,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:56,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:56,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:56,294 INFO L87 Difference]: Start difference. First operand has 161 states, 153 states have (on average 1.7124183006535947) internal successors, (262), 154 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:00,157 INFO L93 Difference]: Finished difference Result 440 states and 746 transitions. [2022-04-08 08:44:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 08:44:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2022-04-08 08:44:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2022-04-08 08:44:00,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 746 transitions. [2022-04-08 08:44:00,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 746 edges. 746 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:00,717 INFO L225 Difference]: With dead ends: 440 [2022-04-08 08:44:00,717 INFO L226 Difference]: Without dead ends: 268 [2022-04-08 08:44:00,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:00,725 INFO L913 BasicCegarLoop]: 164 mSDtfsCounter, 162 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:00,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 481 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-08 08:44:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-08 08:44:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 185. [2022-04-08 08:44:00,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:00,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 185 states, 180 states have (on average 1.6111111111111112) internal successors, (290), 180 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,770 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 185 states, 180 states have (on average 1.6111111111111112) internal successors, (290), 180 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,770 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 185 states, 180 states have (on average 1.6111111111111112) internal successors, (290), 180 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:00,781 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2022-04-08 08:44:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-04-08 08:44:00,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:00,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:00,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 180 states have (on average 1.6111111111111112) internal successors, (290), 180 states have internal predecessors, (290), 3 states have call successors, (3), 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 268 states. [2022-04-08 08:44:00,789 INFO L87 Difference]: Start difference. First operand has 185 states, 180 states have (on average 1.6111111111111112) internal successors, (290), 180 states have internal predecessors, (290), 3 states have call successors, (3), 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 268 states. [2022-04-08 08:44:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:00,799 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2022-04-08 08:44:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-04-08 08:44:00,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:00,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:00,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:00,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.6111111111111112) internal successors, (290), 180 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 294 transitions. [2022-04-08 08:44:00,806 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 294 transitions. Word has length 49 [2022-04-08 08:44:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:00,807 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 294 transitions. [2022-04-08 08:44:00,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:00,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 294 transitions. [2022-04-08 08:44:01,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 294 transitions. [2022-04-08 08:44:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 08:44:01,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:01,002 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:01,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:44:01,002 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1287983627, now seen corresponding path program 1 times [2022-04-08 08:44:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:01,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1405113071] [2022-04-08 08:44:01,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:44:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1287983627, now seen corresponding path program 2 times [2022-04-08 08:44:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:01,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742335766] [2022-04-08 08:44:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:01,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {1969#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {1962#true} is VALID [2022-04-08 08:44:01,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {1962#true} assume true; {1962#true} is VALID [2022-04-08 08:44:01,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1962#true} {1962#true} #710#return; {1962#true} is VALID [2022-04-08 08:44:01,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {1962#true} call ULTIMATE.init(); {1969#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:01,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {1969#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {1962#true} is VALID [2022-04-08 08:44:01,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {1962#true} assume true; {1962#true} is VALID [2022-04-08 08:44:01,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1962#true} {1962#true} #710#return; {1962#true} is VALID [2022-04-08 08:44:01,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {1962#true} call #t~ret161 := main(); {1962#true} is VALID [2022-04-08 08:44:01,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {1962#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1962#true} is VALID [2022-04-08 08:44:01,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {1962#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1962#true} is VALID [2022-04-08 08:44:01,154 INFO L272 TraceCheckUtils]: 7: Hoare triple {1962#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1962#true} is VALID [2022-04-08 08:44:01,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {1962#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:01,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {1967#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1968#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 08:44:01,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {1968#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {1963#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {1963#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {1963#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {1963#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {1963#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {1963#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {1963#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {1963#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {1963#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {1963#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {1963#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {1963#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {1963#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {1963#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {1963#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {1963#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {1963#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {1963#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {1963#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1963#false} is VALID [2022-04-08 08:44:01,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {1963#false} assume 8641 == #t~mem76;havoc #t~mem76; {1963#false} is VALID [2022-04-08 08:44:01,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {1963#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1963#false} is VALID [2022-04-08 08:44:01,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {1963#false} assume !(9 == ~blastFlag~0); {1963#false} is VALID [2022-04-08 08:44:01,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {1963#false} assume 12 == ~blastFlag~0; {1963#false} is VALID [2022-04-08 08:44:01,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {1963#false} assume !false; {1963#false} is VALID [2022-04-08 08:44:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:44:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:01,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742335766] [2022-04-08 08:44:01,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742335766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:01,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:01,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:01,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:01,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1405113071] [2022-04-08 08:44:01,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1405113071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:01,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:01,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:01,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759793394] [2022-04-08 08:44:01,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:01,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:44:01,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:01,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:01,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:01,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:01,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:01,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:01,241 INFO L87 Difference]: Start difference. First operand 185 states and 294 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:03,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:09,881 INFO L93 Difference]: Finished difference Result 383 states and 610 transitions. [2022-04-08 08:44:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-08 08:44:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 08:44:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 08:44:09,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-08 08:44:10,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:10,200 INFO L225 Difference]: With dead ends: 383 [2022-04-08 08:44:10,200 INFO L226 Difference]: Without dead ends: 213 [2022-04-08 08:44:10,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:10,201 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:10,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 499 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 08:44:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-08 08:44:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-04-08 08:44:10,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:10,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 196 states, 191 states have (on average 1.617801047120419) internal successors, (309), 191 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:10,212 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 196 states, 191 states have (on average 1.617801047120419) internal successors, (309), 191 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:10,212 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 196 states, 191 states have (on average 1.617801047120419) internal successors, (309), 191 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:10,220 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2022-04-08 08:44:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-08 08:44:10,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:10,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:10,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.617801047120419) internal successors, (309), 191 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-08 08:44:10,221 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.617801047120419) internal successors, (309), 191 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-08 08:44:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:10,229 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2022-04-08 08:44:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-08 08:44:10,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:10,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:10,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:10,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.617801047120419) internal successors, (309), 191 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 313 transitions. [2022-04-08 08:44:10,260 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 313 transitions. Word has length 50 [2022-04-08 08:44:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:10,261 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 313 transitions. [2022-04-08 08:44:10,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:10,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 313 transitions. [2022-04-08 08:44:10,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 313 transitions. [2022-04-08 08:44:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:44:10,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:10,491 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:10,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:44:10,491 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 41561780, now seen corresponding path program 1 times [2022-04-08 08:44:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252034469] [2022-04-08 08:44:10,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:10,546 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:10,546 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash 41561780, now seen corresponding path program 2 times [2022-04-08 08:44:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:10,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628509047] [2022-04-08 08:44:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:10,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:10,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {3565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {3558#true} is VALID [2022-04-08 08:44:10,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 08:44:10,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3558#true} {3558#true} #710#return; {3558#true} is VALID [2022-04-08 08:44:10,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {3558#true} call ULTIMATE.init(); {3565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:10,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {3565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {3558#true} is VALID [2022-04-08 08:44:10,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-08 08:44:10,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #710#return; {3558#true} is VALID [2022-04-08 08:44:10,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret161 := main(); {3558#true} is VALID [2022-04-08 08:44:10,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {3558#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3558#true} is VALID [2022-04-08 08:44:10,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {3558#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3558#true} is VALID [2022-04-08 08:44:10,752 INFO L272 TraceCheckUtils]: 7: Hoare triple {3558#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3558#true} is VALID [2022-04-08 08:44:10,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {3558#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:10,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3564#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 08:44:10,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {3564#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {3559#false} is VALID [2022-04-08 08:44:10,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {3559#false} is VALID [2022-04-08 08:44:10,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {3559#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {3559#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {3559#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {3559#false} ~skip~0 := 0; {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {3559#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {3559#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {3559#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {3559#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {3559#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {3559#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {3559#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {3559#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {3559#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {3559#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {3559#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {3559#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {3559#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {3559#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {3559#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {3559#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {3559#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {3559#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {3559#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {3559#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {3559#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {3559#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {3559#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {3559#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {3559#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {3559#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {3559#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {3559#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {3559#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {3559#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3559#false} is VALID [2022-04-08 08:44:10,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {3559#false} assume 8641 == #t~mem76;havoc #t~mem76; {3559#false} is VALID [2022-04-08 08:44:10,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {3559#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3559#false} is VALID [2022-04-08 08:44:10,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {3559#false} assume !(9 == ~blastFlag~0); {3559#false} is VALID [2022-04-08 08:44:10,765 INFO L290 TraceCheckUtils]: 61: Hoare triple {3559#false} assume 12 == ~blastFlag~0; {3559#false} is VALID [2022-04-08 08:44:10,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-08 08:44:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:44:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:10,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628509047] [2022-04-08 08:44:10,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628509047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:10,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:10,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:10,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:10,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252034469] [2022-04-08 08:44:10,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252034469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:10,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:10,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781056742] [2022-04-08 08:44:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:44:10,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:10,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:10,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:10,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:10,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:10,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:10,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:10,828 INFO L87 Difference]: Start difference. First operand 196 states and 313 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:15,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:16,654 INFO L93 Difference]: Finished difference Result 383 states and 609 transitions. [2022-04-08 08:44:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:16,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-08 08:44:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:44:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:44:16,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-08 08:44:16,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:16,990 INFO L225 Difference]: With dead ends: 383 [2022-04-08 08:44:16,990 INFO L226 Difference]: Without dead ends: 213 [2022-04-08 08:44:16,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:16,991 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 24 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:16,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 501 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:44:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-08 08:44:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-04-08 08:44:17,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:17,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 196 states, 191 states have (on average 1.612565445026178) internal successors, (308), 191 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:17,025 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 196 states, 191 states have (on average 1.612565445026178) internal successors, (308), 191 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:17,025 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 196 states, 191 states have (on average 1.612565445026178) internal successors, (308), 191 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:17,039 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2022-04-08 08:44:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-08 08:44:17,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:17,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:17,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.612565445026178) internal successors, (308), 191 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-08 08:44:17,056 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.612565445026178) internal successors, (308), 191 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 213 states. [2022-04-08 08:44:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:17,060 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2022-04-08 08:44:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-08 08:44:17,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:17,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:17,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:17,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.612565445026178) internal successors, (308), 191 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 312 transitions. [2022-04-08 08:44:17,064 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 312 transitions. Word has length 63 [2022-04-08 08:44:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:17,064 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 312 transitions. [2022-04-08 08:44:17,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:17,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 312 transitions. [2022-04-08 08:44:17,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 312 transitions. [2022-04-08 08:44:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:44:17,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:17,283 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:17,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:44:17,284 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -674118940, now seen corresponding path program 1 times [2022-04-08 08:44:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:17,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [872595389] [2022-04-08 08:44:17,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:17,304 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:17,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -674118940, now seen corresponding path program 2 times [2022-04-08 08:44:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:17,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249262951] [2022-04-08 08:44:17,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:17,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:17,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {5161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {5154#true} is VALID [2022-04-08 08:44:17,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {5154#true} assume true; {5154#true} is VALID [2022-04-08 08:44:17,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5154#true} {5154#true} #710#return; {5154#true} is VALID [2022-04-08 08:44:17,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {5154#true} call ULTIMATE.init(); {5161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:17,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {5161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {5154#true} is VALID [2022-04-08 08:44:17,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {5154#true} assume true; {5154#true} is VALID [2022-04-08 08:44:17,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5154#true} {5154#true} #710#return; {5154#true} is VALID [2022-04-08 08:44:17,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {5154#true} call #t~ret161 := main(); {5154#true} is VALID [2022-04-08 08:44:17,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {5154#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5154#true} is VALID [2022-04-08 08:44:17,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {5154#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5154#true} is VALID [2022-04-08 08:44:17,491 INFO L272 TraceCheckUtils]: 7: Hoare triple {5154#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5154#true} is VALID [2022-04-08 08:44:17,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {5154#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:17,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:17,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:17,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:17,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:17,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:17,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:44:17,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {5159#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5160#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-08 08:44:17,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {5160#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {5155#false} is VALID [2022-04-08 08:44:17,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {5155#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {5155#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {5155#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5155#false} is VALID [2022-04-08 08:44:17,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {5155#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {5155#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {5155#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {5155#false} is VALID [2022-04-08 08:44:17,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {5155#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {5155#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {5155#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {5155#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5155#false} is VALID [2022-04-08 08:44:17,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {5155#false} ~skip~0 := 0; {5155#false} is VALID [2022-04-08 08:44:17,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {5155#false} assume !false; {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {5155#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {5155#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {5155#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {5155#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {5155#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {5155#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {5155#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {5155#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {5155#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {5155#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {5155#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {5155#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {5155#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {5155#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {5155#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {5155#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {5155#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {5155#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {5155#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {5155#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {5155#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {5155#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {5155#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {5155#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {5155#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {5155#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {5155#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {5155#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {5155#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {5155#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {5155#false} assume 8641 == #t~mem76;havoc #t~mem76; {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {5155#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {5155#false} assume !(9 == ~blastFlag~0); {5155#false} is VALID [2022-04-08 08:44:17,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {5155#false} assume 12 == ~blastFlag~0; {5155#false} is VALID [2022-04-08 08:44:17,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {5155#false} assume !false; {5155#false} is VALID [2022-04-08 08:44:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:44:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:17,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249262951] [2022-04-08 08:44:17,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249262951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:17,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:17,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:17,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:17,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [872595389] [2022-04-08 08:44:17,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [872595389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:17,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:17,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306581076] [2022-04-08 08:44:17,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:44:17,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:17,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:17,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:17,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:17,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:17,555 INFO L87 Difference]: Start difference. First operand 196 states and 312 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:19,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:20,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:22,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:24,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:25,428 INFO L93 Difference]: Finished difference Result 382 states and 607 transitions. [2022-04-08 08:44:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:25,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:44:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:44:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:44:25,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 08:44:25,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:25,717 INFO L225 Difference]: With dead ends: 382 [2022-04-08 08:44:25,717 INFO L226 Difference]: Without dead ends: 212 [2022-04-08 08:44:25,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:25,718 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 28 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:25,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 503 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-08 08:44:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-08 08:44:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 196. [2022-04-08 08:44:25,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:25,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 196 states, 191 states have (on average 1.6073298429319371) internal successors, (307), 191 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:25,725 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 196 states, 191 states have (on average 1.6073298429319371) internal successors, (307), 191 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:25,726 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 196 states, 191 states have (on average 1.6073298429319371) internal successors, (307), 191 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:25,729 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-08 08:44:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-08 08:44:25,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:25,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:25,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.6073298429319371) internal successors, (307), 191 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-08 08:44:25,730 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.6073298429319371) internal successors, (307), 191 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-08 08:44:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:25,733 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-08 08:44:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-08 08:44:25,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:25,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:25,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:25,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.6073298429319371) internal successors, (307), 191 states have internal predecessors, (307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 311 transitions. [2022-04-08 08:44:25,736 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 311 transitions. Word has length 64 [2022-04-08 08:44:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:25,737 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 311 transitions. [2022-04-08 08:44:25,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:25,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 311 transitions. [2022-04-08 08:44:25,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 311 transitions. [2022-04-08 08:44:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:44:25,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:25,964 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:25,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:44:25,964 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1212784504, now seen corresponding path program 1 times [2022-04-08 08:44:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:25,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997454997] [2022-04-08 08:44:26,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:44:26,122 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:44:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1121925032, now seen corresponding path program 1 times [2022-04-08 08:44:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:26,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539657385] [2022-04-08 08:44:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:26,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {6752#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {6746#true} is VALID [2022-04-08 08:44:26,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {6746#true} assume true; {6746#true} is VALID [2022-04-08 08:44:26,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6746#true} {6746#true} #710#return; {6746#true} is VALID [2022-04-08 08:44:26,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {6746#true} call ULTIMATE.init(); {6752#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:26,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {6752#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {6746#true} is VALID [2022-04-08 08:44:26,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {6746#true} assume true; {6746#true} is VALID [2022-04-08 08:44:26,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6746#true} {6746#true} #710#return; {6746#true} is VALID [2022-04-08 08:44:26,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {6746#true} call #t~ret161 := main(); {6746#true} is VALID [2022-04-08 08:44:26,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {6746#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {6746#true} is VALID [2022-04-08 08:44:26,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {6746#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6746#true} is VALID [2022-04-08 08:44:26,248 INFO L272 TraceCheckUtils]: 7: Hoare triple {6746#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6746#true} is VALID [2022-04-08 08:44:26,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {6746#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} [716] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_257|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} [715] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {6751#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:26,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {6747#false} is VALID [2022-04-08 08:44:26,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {6747#false} assume !false; {6747#false} is VALID [2022-04-08 08:44:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:44:26,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:26,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539657385] [2022-04-08 08:44:26,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539657385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:26,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:26,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:44:30,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:30,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997454997] [2022-04-08 08:44:30,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997454997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:30,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:30,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:44:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793559661] [2022-04-08 08:44:30,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:30,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:44:30,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:30,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:30,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:30,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:44:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:30,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:44:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:44:30,427 INFO L87 Difference]: Start difference. First operand 196 states and 311 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:34,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:37,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:39,429 INFO L93 Difference]: Finished difference Result 534 states and 861 transitions. [2022-04-08 08:44:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:44:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:44:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 625 transitions. [2022-04-08 08:44:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 625 transitions. [2022-04-08 08:44:39,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 625 transitions. [2022-04-08 08:44:39,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:39,892 INFO L225 Difference]: With dead ends: 534 [2022-04-08 08:44:39,892 INFO L226 Difference]: Without dead ends: 364 [2022-04-08 08:44:39,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:44:39,893 INFO L913 BasicCegarLoop]: 346 mSDtfsCounter, 148 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:39,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 927 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 722 Invalid, 1 Unknown, 227 Unchecked, 5.1s Time] [2022-04-08 08:44:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-08 08:44:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 359. [2022-04-08 08:44:39,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:39,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,905 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,905 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:39,912 INFO L93 Difference]: Finished difference Result 364 states and 572 transitions. [2022-04-08 08:44:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 572 transitions. [2022-04-08 08:44:39,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:39,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:39,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 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 364 states. [2022-04-08 08:44:39,914 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 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 364 states. [2022-04-08 08:44:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:39,920 INFO L93 Difference]: Finished difference Result 364 states and 572 transitions. [2022-04-08 08:44:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 572 transitions. [2022-04-08 08:44:39,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:39,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:39,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:39,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 566 transitions. [2022-04-08 08:44:39,929 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 566 transitions. Word has length 64 [2022-04-08 08:44:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:39,929 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 566 transitions. [2022-04-08 08:44:39,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 566 transitions. [2022-04-08 08:44:40,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 566 transitions. [2022-04-08 08:44:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 08:44:40,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:40,332 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:40,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:44:40,332 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2106270842, now seen corresponding path program 1 times [2022-04-08 08:44:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:40,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878701823] [2022-04-08 08:44:40,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:44:40,454 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:44:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -856760296, now seen corresponding path program 1 times [2022-04-08 08:44:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:40,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681482871] [2022-04-08 08:44:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:40,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:40,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:40,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {9284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {9278#true} is VALID [2022-04-08 08:44:40,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {9278#true} assume true; {9278#true} is VALID [2022-04-08 08:44:40,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9278#true} {9278#true} #710#return; {9278#true} is VALID [2022-04-08 08:44:40,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {9278#true} call ULTIMATE.init(); {9284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:40,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {9284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {9278#true} is VALID [2022-04-08 08:44:40,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {9278#true} assume true; {9278#true} is VALID [2022-04-08 08:44:40,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9278#true} {9278#true} #710#return; {9278#true} is VALID [2022-04-08 08:44:40,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {9278#true} call #t~ret161 := main(); {9278#true} is VALID [2022-04-08 08:44:40,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {9278#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9278#true} is VALID [2022-04-08 08:44:40,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {9278#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9278#true} is VALID [2022-04-08 08:44:40,573 INFO L272 TraceCheckUtils]: 7: Hoare triple {9278#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9278#true} is VALID [2022-04-08 08:44:40,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {9278#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} [718] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_14|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_275|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_14|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_14|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_15|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_13|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_8|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_14|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_14|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_13|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_16|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_9|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_19, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_8|, #memory_int=|v_#memory_int_275|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_275|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_11} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} [717] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:44:40,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {9279#false} is VALID [2022-04-08 08:44:40,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {9279#false} assume !false; {9279#false} is VALID [2022-04-08 08:44:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:44:40,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:40,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681482871] [2022-04-08 08:44:40,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681482871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:40,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:40,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:44:43,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878701823] [2022-04-08 08:44:43,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878701823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:43,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:43,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:44:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957448181] [2022-04-08 08:44:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:44:43,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:43,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:43,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:44:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:44:43,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:44:43,849 INFO L87 Difference]: Start difference. First operand 359 states and 566 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:47,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:50,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-08 08:44:52,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:53,927 INFO L93 Difference]: Finished difference Result 538 states and 853 transitions. [2022-04-08 08:44:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:44:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 08:44:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-08 08:44:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-08 08:44:53,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 612 transitions. [2022-04-08 08:44:54,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:54,248 INFO L225 Difference]: With dead ends: 538 [2022-04-08 08:44:54,248 INFO L226 Difference]: Without dead ends: 368 [2022-04-08 08:44:54,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-08 08:44:54,249 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 148 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:54,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 821 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 535 Invalid, 3 Unknown, 364 Unchecked, 7.7s Time] [2022-04-08 08:44:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-08 08:44:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 359. [2022-04-08 08:44:54,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:54,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:54,275 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:54,276 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:54,283 INFO L93 Difference]: Finished difference Result 368 states and 577 transitions. [2022-04-08 08:44:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 577 transitions. [2022-04-08 08:44:54,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:54,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:54,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 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 368 states. [2022-04-08 08:44:54,285 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 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 368 states. [2022-04-08 08:44:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:54,292 INFO L93 Difference]: Finished difference Result 368 states and 577 transitions. [2022-04-08 08:44:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 577 transitions. [2022-04-08 08:44:54,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:54,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:54,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:54,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.5875706214689265) internal successors, (562), 354 states have internal predecessors, (562), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 566 transitions. [2022-04-08 08:44:54,304 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 566 transitions. Word has length 64 [2022-04-08 08:44:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:54,305 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 566 transitions. [2022-04-08 08:44:54,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:54,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 566 transitions. [2022-04-08 08:44:54,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 566 transitions. [2022-04-08 08:44:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:44:54,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:54,787 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:54,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:44:54,787 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1071065521, now seen corresponding path program 1 times [2022-04-08 08:44:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:54,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960425882] [2022-04-08 08:44:54,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:44:54,819 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:44:54,819 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1071065521, now seen corresponding path program 2 times [2022-04-08 08:44:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:54,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048461205] [2022-04-08 08:44:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:54,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {11833#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {11826#true} is VALID [2022-04-08 08:44:54,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {11826#true} assume true; {11826#true} is VALID [2022-04-08 08:44:54,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11826#true} {11826#true} #710#return; {11826#true} is VALID [2022-04-08 08:44:54,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {11826#true} call ULTIMATE.init(); {11833#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:44:54,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {11833#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {11826#true} is VALID [2022-04-08 08:44:54,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {11826#true} assume true; {11826#true} is VALID [2022-04-08 08:44:54,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11826#true} {11826#true} #710#return; {11826#true} is VALID [2022-04-08 08:44:54,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {11826#true} call #t~ret161 := main(); {11826#true} is VALID [2022-04-08 08:44:54,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {11826#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {11826#true} is VALID [2022-04-08 08:44:54,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {11826#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {11826#true} is VALID [2022-04-08 08:44:54,947 INFO L272 TraceCheckUtils]: 7: Hoare triple {11826#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {11826#true} is VALID [2022-04-08 08:44:54,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {11826#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:44:54,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {11831#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11832#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 08:44:54,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {11832#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {11827#false} is VALID [2022-04-08 08:44:54,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {11827#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {11827#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11827#false} is VALID [2022-04-08 08:44:54,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {11827#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {11827#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {11827#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {11827#false} is VALID [2022-04-08 08:44:54,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {11827#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {11827#false} assume 12292 != #t~mem85;havoc #t~mem85; {11827#false} is VALID [2022-04-08 08:44:54,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {11827#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {11827#false} is VALID [2022-04-08 08:44:54,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {11827#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {11827#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {11827#false} is VALID [2022-04-08 08:44:54,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {11827#false} ~skip~0 := 0; {11827#false} is VALID [2022-04-08 08:44:54,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {11827#false} assume !false; {11827#false} is VALID [2022-04-08 08:44:54,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {11827#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {11827#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {11827#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {11827#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {11827#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {11827#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {11827#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {11827#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {11827#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {11827#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {11827#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {11827#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {11827#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {11827#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {11827#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {11827#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {11827#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {11827#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {11827#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {11827#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {11827#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {11827#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {11827#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {11827#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {11827#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 55: Hoare triple {11827#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {11827#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {11827#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {11827#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 59: Hoare triple {11827#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {11827#false} is VALID [2022-04-08 08:44:54,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {11827#false} assume 8641 == #t~mem76;havoc #t~mem76; {11827#false} is VALID [2022-04-08 08:44:54,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {11827#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {11827#false} is VALID [2022-04-08 08:44:54,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {11827#false} assume !(9 == ~blastFlag~0); {11827#false} is VALID [2022-04-08 08:44:54,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {11827#false} assume 12 == ~blastFlag~0; {11827#false} is VALID [2022-04-08 08:44:54,962 INFO L290 TraceCheckUtils]: 64: Hoare triple {11827#false} assume !false; {11827#false} is VALID [2022-04-08 08:44:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:44:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:54,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048461205] [2022-04-08 08:44:54,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048461205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:54,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:54,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:54,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:54,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960425882] [2022-04-08 08:44:54,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960425882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:54,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:54,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009764717] [2022-04-08 08:44:54,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:54,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:44:54,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:54,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:55,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:55,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:55,011 INFO L87 Difference]: Start difference. First operand 359 states and 566 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:59,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:03,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:04,279 INFO L93 Difference]: Finished difference Result 766 states and 1206 transitions. [2022-04-08 08:45:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:04,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:45:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-08 08:45:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-08 08:45:04,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-08 08:45:04,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:04,710 INFO L225 Difference]: With dead ends: 766 [2022-04-08 08:45:04,711 INFO L226 Difference]: Without dead ends: 589 [2022-04-08 08:45:04,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:04,712 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:04,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 362 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-08 08:45:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-04-08 08:45:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 383. [2022-04-08 08:45:04,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:04,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand has 383 states, 378 states have (on average 1.5740740740740742) internal successors, (595), 378 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:04,738 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand has 383 states, 378 states have (on average 1.5740740740740742) internal successors, (595), 378 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:04,739 INFO L87 Difference]: Start difference. First operand 589 states. Second operand has 383 states, 378 states have (on average 1.5740740740740742) internal successors, (595), 378 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:04,751 INFO L93 Difference]: Finished difference Result 589 states and 917 transitions. [2022-04-08 08:45:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 917 transitions. [2022-04-08 08:45:04,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:04,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:04,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 378 states have (on average 1.5740740740740742) internal successors, (595), 378 states have internal predecessors, (595), 3 states have call successors, (3), 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 589 states. [2022-04-08 08:45:04,754 INFO L87 Difference]: Start difference. First operand has 383 states, 378 states have (on average 1.5740740740740742) internal successors, (595), 378 states have internal predecessors, (595), 3 states have call successors, (3), 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 589 states. [2022-04-08 08:45:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:04,765 INFO L93 Difference]: Finished difference Result 589 states and 917 transitions. [2022-04-08 08:45:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 917 transitions. [2022-04-08 08:45:04,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:04,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:04,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:04,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 378 states have (on average 1.5740740740740742) internal successors, (595), 378 states have internal predecessors, (595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 599 transitions. [2022-04-08 08:45:04,774 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 599 transitions. Word has length 65 [2022-04-08 08:45:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:04,774 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 599 transitions. [2022-04-08 08:45:04,774 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:04,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 383 states and 599 transitions. [2022-04-08 08:45:05,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 599 transitions. [2022-04-08 08:45:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:45:05,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:05,308 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:05,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:45:05,309 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -615987875, now seen corresponding path program 1 times [2022-04-08 08:45:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:05,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036597497] [2022-04-08 08:45:05,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:05,447 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash -591595560, now seen corresponding path program 1 times [2022-04-08 08:45:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:05,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322092303] [2022-04-08 08:45:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:05,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {15320#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {15314#true} is VALID [2022-04-08 08:45:05,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {15314#true} assume true; {15314#true} is VALID [2022-04-08 08:45:05,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15314#true} {15314#true} #710#return; {15314#true} is VALID [2022-04-08 08:45:05,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {15314#true} call ULTIMATE.init(); {15320#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:05,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {15320#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {15314#true} is VALID [2022-04-08 08:45:05,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {15314#true} assume true; {15314#true} is VALID [2022-04-08 08:45:05,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15314#true} {15314#true} #710#return; {15314#true} is VALID [2022-04-08 08:45:05,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {15314#true} call #t~ret161 := main(); {15314#true} is VALID [2022-04-08 08:45:05,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {15314#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {15314#true} is VALID [2022-04-08 08:45:05,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {15314#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15314#true} is VALID [2022-04-08 08:45:05,530 INFO L272 TraceCheckUtils]: 7: Hoare triple {15314#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15314#true} is VALID [2022-04-08 08:45:05,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {15314#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} [720] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_22|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_315|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_22|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_22|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_22|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_20|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_12|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_22|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_22|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_20|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_24|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_14|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_24, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_12|, #memory_int=|v_#memory_int_304|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_12|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_315|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_16} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} [719] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:05,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {15315#false} is VALID [2022-04-08 08:45:05,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {15315#false} assume !false; {15315#false} is VALID [2022-04-08 08:45:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:05,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:05,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322092303] [2022-04-08 08:45:05,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322092303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:05,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:05,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:45:08,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:08,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036597497] [2022-04-08 08:45:08,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036597497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:08,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:08,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:45:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892804592] [2022-04-08 08:45:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:08,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:45:08,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:08,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:08,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:08,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:45:08,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:45:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:45:08,521 INFO L87 Difference]: Start difference. First operand 383 states and 599 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:12,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:16,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:19,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:22,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:24,705 INFO L93 Difference]: Finished difference Result 577 states and 907 transitions. [2022-04-08 08:45:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:45:24,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:45:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 612 transitions. [2022-04-08 08:45:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 612 transitions. [2022-04-08 08:45:24,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 612 transitions. [2022-04-08 08:45:25,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:25,183 INFO L225 Difference]: With dead ends: 577 [2022-04-08 08:45:25,183 INFO L226 Difference]: Without dead ends: 395 [2022-04-08 08:45:25,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:45:25,184 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 145 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:25,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 809 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 789 Invalid, 1 Unknown, 150 Unchecked, 8.3s Time] [2022-04-08 08:45:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-08 08:45:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 385. [2022-04-08 08:45:25,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:25,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:25,197 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:25,197 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:25,204 INFO L93 Difference]: Finished difference Result 395 states and 614 transitions. [2022-04-08 08:45:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 614 transitions. [2022-04-08 08:45:25,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:25,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:25,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 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 395 states. [2022-04-08 08:45:25,206 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 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 395 states. [2022-04-08 08:45:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:25,232 INFO L93 Difference]: Finished difference Result 395 states and 614 transitions. [2022-04-08 08:45:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 614 transitions. [2022-04-08 08:45:25,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:25,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:25,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:25,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 602 transitions. [2022-04-08 08:45:25,240 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 602 transitions. Word has length 65 [2022-04-08 08:45:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:25,240 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 602 transitions. [2022-04-08 08:45:25,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:25,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 602 transitions. [2022-04-08 08:45:26,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 602 transitions. [2022-04-08 08:45:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 08:45:26,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:26,127 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:26,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:45:26,128 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash 277498463, now seen corresponding path program 1 times [2022-04-08 08:45:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:26,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102347752] [2022-04-08 08:45:26,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:26,265 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash -326430824, now seen corresponding path program 1 times [2022-04-08 08:45:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:26,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074227898] [2022-04-08 08:45:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:26,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:26,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {18053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {18047#true} is VALID [2022-04-08 08:45:26,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {18047#true} assume true; {18047#true} is VALID [2022-04-08 08:45:26,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18047#true} {18047#true} #710#return; {18047#true} is VALID [2022-04-08 08:45:26,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {18047#true} call ULTIMATE.init(); {18053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:26,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {18053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {18047#true} is VALID [2022-04-08 08:45:26,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {18047#true} assume true; {18047#true} is VALID [2022-04-08 08:45:26,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18047#true} {18047#true} #710#return; {18047#true} is VALID [2022-04-08 08:45:26,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {18047#true} call #t~ret161 := main(); {18047#true} is VALID [2022-04-08 08:45:26,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {18047#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18047#true} is VALID [2022-04-08 08:45:26,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {18047#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18047#true} is VALID [2022-04-08 08:45:26,359 INFO L272 TraceCheckUtils]: 7: Hoare triple {18047#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18047#true} is VALID [2022-04-08 08:45:26,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {18047#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} [722] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_28|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_334|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_28|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_28|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_27|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_25|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_16|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_28|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_14|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_28|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_25|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_30|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_18|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_28, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_16|, #memory_int=|v_#memory_int_322|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_16|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_334|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_20} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} [721] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:26,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {18048#false} is VALID [2022-04-08 08:45:26,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {18048#false} assume !false; {18048#false} is VALID [2022-04-08 08:45:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:26,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074227898] [2022-04-08 08:45:26,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074227898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:26,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:26,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:45:29,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:29,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102347752] [2022-04-08 08:45:29,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102347752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:29,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:29,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:45:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646804506] [2022-04-08 08:45:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:29,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:45:29,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:29,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:29,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:29,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:45:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:29,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:45:29,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:45:29,337 INFO L87 Difference]: Start difference. First operand 385 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:33,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:34,956 INFO L93 Difference]: Finished difference Result 578 states and 908 transitions. [2022-04-08 08:45:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:45:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 08:45:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 453 transitions. [2022-04-08 08:45:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 453 transitions. [2022-04-08 08:45:34,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 453 transitions. [2022-04-08 08:45:35,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:35,343 INFO L225 Difference]: With dead ends: 578 [2022-04-08 08:45:35,343 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 08:45:35,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-08 08:45:35,344 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 9 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:35,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 469 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 1 Unknown, 154 Unchecked, 2.8s Time] [2022-04-08 08:45:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 08:45:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2022-04-08 08:45:35,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:35,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:35,370 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:35,371 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:35,377 INFO L93 Difference]: Finished difference Result 396 states and 615 transitions. [2022-04-08 08:45:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2022-04-08 08:45:35,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:35,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:35,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 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 396 states. [2022-04-08 08:45:35,379 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 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 396 states. [2022-04-08 08:45:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:35,401 INFO L93 Difference]: Finished difference Result 396 states and 615 transitions. [2022-04-08 08:45:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2022-04-08 08:45:35,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:35,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:35,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:35,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.5736842105263158) internal successors, (598), 380 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 602 transitions. [2022-04-08 08:45:35,423 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 602 transitions. Word has length 65 [2022-04-08 08:45:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:35,424 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 602 transitions. [2022-04-08 08:45:35,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:35,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 602 transitions. [2022-04-08 08:45:36,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 602 transitions. [2022-04-08 08:45:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:45:36,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:36,433 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:36,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:45:36,433 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash 213696620, now seen corresponding path program 1 times [2022-04-08 08:45:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:36,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [712625246] [2022-04-08 08:45:36,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:45:36,451 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:45:36,451 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash 213696620, now seen corresponding path program 2 times [2022-04-08 08:45:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:36,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261200643] [2022-04-08 08:45:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:36,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:36,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {20791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {20784#true} is VALID [2022-04-08 08:45:36,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {20784#true} assume true; {20784#true} is VALID [2022-04-08 08:45:36,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20784#true} {20784#true} #710#return; {20784#true} is VALID [2022-04-08 08:45:36,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {20784#true} call ULTIMATE.init(); {20791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:36,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {20791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {20784#true} is VALID [2022-04-08 08:45:36,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {20784#true} assume true; {20784#true} is VALID [2022-04-08 08:45:36,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20784#true} {20784#true} #710#return; {20784#true} is VALID [2022-04-08 08:45:36,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {20784#true} call #t~ret161 := main(); {20784#true} is VALID [2022-04-08 08:45:36,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {20784#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20784#true} is VALID [2022-04-08 08:45:36,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {20784#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20784#true} is VALID [2022-04-08 08:45:36,558 INFO L272 TraceCheckUtils]: 7: Hoare triple {20784#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20784#true} is VALID [2022-04-08 08:45:36,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {20784#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:45:36,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {20789#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20790#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-08 08:45:36,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {20790#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {20785#false} is VALID [2022-04-08 08:45:36,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {20785#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {20785#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {20785#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {20785#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {20785#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {20785#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {20785#false} assume 12292 != #t~mem85;havoc #t~mem85; {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {20785#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {20785#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {20785#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {20785#false} ~skip~0 := 0; {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {20785#false} assume !false; {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {20785#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {20785#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {20785#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {20785#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {20785#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {20785#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {20785#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {20785#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {20785#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {20785#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {20785#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {20785#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {20785#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {20785#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {20785#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {20785#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {20785#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {20785#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {20785#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {20785#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {20785#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {20785#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {20785#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 54: Hoare triple {20785#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {20785#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {20785#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {20785#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {20785#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {20785#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {20785#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {20785#false} assume 8641 == #t~mem76;havoc #t~mem76; {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {20785#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {20785#false} assume !(9 == ~blastFlag~0); {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {20785#false} assume 12 == ~blastFlag~0; {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {20785#false} assume !false; {20785#false} is VALID [2022-04-08 08:45:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:36,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261200643] [2022-04-08 08:45:36,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261200643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:36,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:36,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:36,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:36,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [712625246] [2022-04-08 08:45:36,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [712625246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:36,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:36,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:45:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990502877] [2022-04-08 08:45:36,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:36,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:45:36,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:36,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:36,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:36,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:45:36,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:36,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:45:36,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:45:36,622 INFO L87 Difference]: Start difference. First operand 385 states and 602 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:40,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:43,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:45,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:46,409 INFO L93 Difference]: Finished difference Result 590 states and 922 transitions. [2022-04-08 08:45:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:45:46,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:45:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:45:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-08 08:45:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-08 08:45:46,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 458 transitions. [2022-04-08 08:45:46,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:46,724 INFO L225 Difference]: With dead ends: 590 [2022-04-08 08:45:46,724 INFO L226 Difference]: Without dead ends: 401 [2022-04-08 08:45:46,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:45:46,724 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 23 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:45:46,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 503 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-08 08:45:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-08 08:45:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 385. [2022-04-08 08:45:46,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:45:46,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,737 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,737 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:46,744 INFO L93 Difference]: Finished difference Result 401 states and 620 transitions. [2022-04-08 08:45:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 620 transitions. [2022-04-08 08:45:46,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:46,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:46,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 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-08 08:45:46,745 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 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-08 08:45:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:45:46,752 INFO L93 Difference]: Finished difference Result 401 states and 620 transitions. [2022-04-08 08:45:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 620 transitions. [2022-04-08 08:45:46,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:45:46,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:45:46,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:45:46,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:45:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 601 transitions. [2022-04-08 08:45:46,775 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 601 transitions. Word has length 66 [2022-04-08 08:45:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:45:46,775 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 601 transitions. [2022-04-08 08:45:46,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:46,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 601 transitions. [2022-04-08 08:45:47,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 601 transitions. [2022-04-08 08:45:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:45:47,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:45:47,994 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:45:47,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:45:47,994 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:45:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:45:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash -208594083, now seen corresponding path program 1 times [2022-04-08 08:45:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:47,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066068888] [2022-04-08 08:45:48,142 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:45:48,142 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:45:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -61266088, now seen corresponding path program 1 times [2022-04-08 08:45:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:48,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419917805] [2022-04-08 08:45:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:48,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {23554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {23548#true} is VALID [2022-04-08 08:45:48,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {23548#true} assume true; {23548#true} is VALID [2022-04-08 08:45:48,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23548#true} {23548#true} #710#return; {23548#true} is VALID [2022-04-08 08:45:48,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {23548#true} call ULTIMATE.init(); {23554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:45:48,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {23554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {23548#true} is VALID [2022-04-08 08:45:48,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {23548#true} assume true; {23548#true} is VALID [2022-04-08 08:45:48,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23548#true} {23548#true} #710#return; {23548#true} is VALID [2022-04-08 08:45:48,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {23548#true} call #t~ret161 := main(); {23548#true} is VALID [2022-04-08 08:45:48,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {23548#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23548#true} is VALID [2022-04-08 08:45:48,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {23548#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23548#true} is VALID [2022-04-08 08:45:48,227 INFO L272 TraceCheckUtils]: 7: Hoare triple {23548#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23548#true} is VALID [2022-04-08 08:45:48,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {23548#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} [724] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_36|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_374|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_36|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_36|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_34|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_32|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_20|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_36|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_22|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_36|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_32|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_38|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_23|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_33, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_20|, #memory_int=|v_#memory_int_351|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_374|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_25} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} [723] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:45:48,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {23549#false} is VALID [2022-04-08 08:45:48,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {23549#false} assume !false; {23549#false} is VALID [2022-04-08 08:45:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:45:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:48,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419917805] [2022-04-08 08:45:48,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419917805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:48,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:48,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:45:51,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:45:51,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066068888] [2022-04-08 08:45:51,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066068888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:45:51,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:45:51,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:45:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49619912] [2022-04-08 08:45:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:45:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:45:51,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:45:51,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:51,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:45:51,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:45:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:45:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:45:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:45:51,575 INFO L87 Difference]: Start difference. First operand 385 states and 601 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:45:53,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:57,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:45:59,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:01,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:05,795 INFO L93 Difference]: Finished difference Result 579 states and 909 transitions. [2022-04-08 08:46:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:46:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 612 transitions. [2022-04-08 08:46:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 612 transitions. [2022-04-08 08:46:05,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 612 transitions. [2022-04-08 08:46:06,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:06,231 INFO L225 Difference]: With dead ends: 579 [2022-04-08 08:46:06,231 INFO L226 Difference]: Without dead ends: 397 [2022-04-08 08:46:06,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:46:06,232 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 146 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:06,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 786 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 856 Invalid, 2 Unknown, 18 Unchecked, 8.9s Time] [2022-04-08 08:46:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-08 08:46:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 385. [2022-04-08 08:46:06,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:06,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:06,245 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:06,246 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:06,252 INFO L93 Difference]: Finished difference Result 397 states and 616 transitions. [2022-04-08 08:46:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 616 transitions. [2022-04-08 08:46:06,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:06,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:06,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 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 397 states. [2022-04-08 08:46:06,254 INFO L87 Difference]: Start difference. First operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 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 397 states. [2022-04-08 08:46:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:06,260 INFO L93 Difference]: Finished difference Result 397 states and 616 transitions. [2022-04-08 08:46:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 616 transitions. [2022-04-08 08:46:06,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:06,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:06,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:06,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 380 states have (on average 1.5710526315789475) internal successors, (597), 380 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 601 transitions. [2022-04-08 08:46:06,276 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 601 transitions. Word has length 66 [2022-04-08 08:46:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:06,276 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 601 transitions. [2022-04-08 08:46:06,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:06,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 601 transitions. [2022-04-08 08:46:08,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 601 transitions. [2022-04-08 08:46:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 08:46:08,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:08,687 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:08,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:46:08,687 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash 684892255, now seen corresponding path program 1 times [2022-04-08 08:46:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:08,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835938377] [2022-04-08 08:46:08,919 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:46:08,919 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:46:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash 203898648, now seen corresponding path program 1 times [2022-04-08 08:46:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:08,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977617036] [2022-04-08 08:46:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:09,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {26296#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {26290#true} is VALID [2022-04-08 08:46:09,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {26290#true} assume true; {26290#true} is VALID [2022-04-08 08:46:09,105 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26290#true} {26290#true} #710#return; {26290#true} is VALID [2022-04-08 08:46:09,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {26290#true} call ULTIMATE.init(); {26296#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:09,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {26296#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {26290#true} is VALID [2022-04-08 08:46:09,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {26290#true} assume true; {26290#true} is VALID [2022-04-08 08:46:09,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26290#true} {26290#true} #710#return; {26290#true} is VALID [2022-04-08 08:46:09,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {26290#true} call #t~ret161 := main(); {26290#true} is VALID [2022-04-08 08:46:09,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {26290#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26290#true} is VALID [2022-04-08 08:46:09,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {26290#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26290#true} is VALID [2022-04-08 08:46:09,106 INFO L272 TraceCheckUtils]: 7: Hoare triple {26290#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26290#true} is VALID [2022-04-08 08:46:09,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {26290#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} [726] L1167-2-->L1168_primed: Formula: true InVars {} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_393|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_42|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_42|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_39|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_37|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_24|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_42|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_28|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_42|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_37|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_44|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_27|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_37, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_24|, #memory_int=|v_#memory_int_369|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_393|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_29} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} [725] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,116 INFO L290 TraceCheckUtils]: 47: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:46:09,116 INFO L290 TraceCheckUtils]: 49: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {26291#false} is VALID [2022-04-08 08:46:09,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {26291#false} assume !false; {26291#false} is VALID [2022-04-08 08:46:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977617036] [2022-04-08 08:46:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977617036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:09,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:09,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:46:13,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835938377] [2022-04-08 08:46:13,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835938377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:13,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:13,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:46:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187745438] [2022-04-08 08:46:13,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:13,177 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:13,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:13,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:13,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:13,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:46:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:46:13,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:46:13,243 INFO L87 Difference]: Start difference. First operand 385 states and 601 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:15,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:21,357 INFO L93 Difference]: Finished difference Result 755 states and 1196 transitions. [2022-04-08 08:46:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:46:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 08:46:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 633 transitions. [2022-04-08 08:46:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 633 transitions. [2022-04-08 08:46:21,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 633 transitions. [2022-04-08 08:46:21,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:21,811 INFO L225 Difference]: With dead ends: 755 [2022-04-08 08:46:21,812 INFO L226 Difference]: Without dead ends: 573 [2022-04-08 08:46:21,813 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-08 08:46:21,813 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 154 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 700 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:21,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 1081 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 771 Invalid, 1 Unknown, 700 Unchecked, 3.8s Time] [2022-04-08 08:46:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-04-08 08:46:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 564. [2022-04-08 08:46:21,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:21,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 573 states. Second operand has 564 states, 559 states have (on average 1.5652951699463327) internal successors, (875), 559 states have internal predecessors, (875), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:21,832 INFO L74 IsIncluded]: Start isIncluded. First operand 573 states. Second operand has 564 states, 559 states have (on average 1.5652951699463327) internal successors, (875), 559 states have internal predecessors, (875), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:21,833 INFO L87 Difference]: Start difference. First operand 573 states. Second operand has 564 states, 559 states have (on average 1.5652951699463327) internal successors, (875), 559 states have internal predecessors, (875), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:21,843 INFO L93 Difference]: Finished difference Result 573 states and 890 transitions. [2022-04-08 08:46:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 890 transitions. [2022-04-08 08:46:21,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:21,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:21,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 564 states, 559 states have (on average 1.5652951699463327) internal successors, (875), 559 states have internal predecessors, (875), 3 states have call successors, (3), 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 573 states. [2022-04-08 08:46:21,846 INFO L87 Difference]: Start difference. First operand has 564 states, 559 states have (on average 1.5652951699463327) internal successors, (875), 559 states have internal predecessors, (875), 3 states have call successors, (3), 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 573 states. [2022-04-08 08:46:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:21,857 INFO L93 Difference]: Finished difference Result 573 states and 890 transitions. [2022-04-08 08:46:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 890 transitions. [2022-04-08 08:46:21,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:21,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:21,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:21,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 559 states have (on average 1.5652951699463327) internal successors, (875), 559 states have internal predecessors, (875), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 879 transitions. [2022-04-08 08:46:21,872 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 879 transitions. Word has length 66 [2022-04-08 08:46:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:21,873 INFO L478 AbstractCegarLoop]: Abstraction has 564 states and 879 transitions. [2022-04-08 08:46:21,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:21,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 564 states and 879 transitions. [2022-04-08 08:46:24,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 878 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 879 transitions. [2022-04-08 08:46:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 08:46:24,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:24,703 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:24,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:46:24,703 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -260095797, now seen corresponding path program 1 times [2022-04-08 08:46:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:24,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997401049] [2022-04-08 08:46:24,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:24,747 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:24,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash -260095797, now seen corresponding path program 2 times [2022-04-08 08:46:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:24,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670231791] [2022-04-08 08:46:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:24,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:24,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {30101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {30094#true} is VALID [2022-04-08 08:46:24,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {30094#true} assume true; {30094#true} is VALID [2022-04-08 08:46:24,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30094#true} {30094#true} #710#return; {30094#true} is VALID [2022-04-08 08:46:24,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {30094#true} call ULTIMATE.init(); {30101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:24,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {30101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {30094#true} is VALID [2022-04-08 08:46:24,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {30094#true} assume true; {30094#true} is VALID [2022-04-08 08:46:24,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30094#true} {30094#true} #710#return; {30094#true} is VALID [2022-04-08 08:46:24,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {30094#true} call #t~ret161 := main(); {30094#true} is VALID [2022-04-08 08:46:24,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {30094#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30094#true} is VALID [2022-04-08 08:46:24,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {30094#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L272 TraceCheckUtils]: 7: Hoare triple {30094#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {30094#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {30094#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {30094#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {30094#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {30094#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {30094#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {30094#true} assume !false; {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {30094#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {30094#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {30094#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {30094#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {30094#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {30094#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {30094#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {30094#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {30094#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30094#true} is VALID [2022-04-08 08:46:24,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#true} assume 8464 == #t~mem55;havoc #t~mem55; {30094#true} is VALID [2022-04-08 08:46:24,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {30094#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30094#true} is VALID [2022-04-08 08:46:24,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30094#true} is VALID [2022-04-08 08:46:24,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {30094#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:24,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {30099#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30100#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 08:46:24,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {30100#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {30095#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {30095#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {30095#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {30095#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {30095#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {30095#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {30095#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 52: Hoare triple {30095#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {30095#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {30095#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {30095#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {30095#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {30095#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {30095#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {30095#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {30095#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {30095#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {30095#false} assume 8641 == #t~mem76;havoc #t~mem76; {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 63: Hoare triple {30095#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {30095#false} assume !(9 == ~blastFlag~0); {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {30095#false} assume 12 == ~blastFlag~0; {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {30095#false} assume !false; {30095#false} is VALID [2022-04-08 08:46:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:24,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670231791] [2022-04-08 08:46:24,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670231791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:24,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:24,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:24,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:24,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997401049] [2022-04-08 08:46:24,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997401049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:24,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:24,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434420822] [2022-04-08 08:46:24,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:24,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:46:24,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:24,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:24,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:24,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:24,990 INFO L87 Difference]: Start difference. First operand 564 states and 879 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:30,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:32,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:34,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:38,249 INFO L93 Difference]: Finished difference Result 789 states and 1236 transitions. [2022-04-08 08:46:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:38,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-08 08:46:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-08 08:46:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-08 08:46:38,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 488 transitions. [2022-04-08 08:46:38,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:38,616 INFO L225 Difference]: With dead ends: 789 [2022-04-08 08:46:38,616 INFO L226 Difference]: Without dead ends: 607 [2022-04-08 08:46:38,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:38,617 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 33 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:38,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 613 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-08 08:46:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-04-08 08:46:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 586. [2022-04-08 08:46:38,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:38,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 607 states. Second operand has 586 states, 581 states have (on average 1.5697074010327023) internal successors, (912), 581 states have internal predecessors, (912), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,641 INFO L74 IsIncluded]: Start isIncluded. First operand 607 states. Second operand has 586 states, 581 states have (on average 1.5697074010327023) internal successors, (912), 581 states have internal predecessors, (912), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,641 INFO L87 Difference]: Start difference. First operand 607 states. Second operand has 586 states, 581 states have (on average 1.5697074010327023) internal successors, (912), 581 states have internal predecessors, (912), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:38,656 INFO L93 Difference]: Finished difference Result 607 states and 943 transitions. [2022-04-08 08:46:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 943 transitions. [2022-04-08 08:46:38,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:38,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:38,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 586 states, 581 states have (on average 1.5697074010327023) internal successors, (912), 581 states have internal predecessors, (912), 3 states have call successors, (3), 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 607 states. [2022-04-08 08:46:38,659 INFO L87 Difference]: Start difference. First operand has 586 states, 581 states have (on average 1.5697074010327023) internal successors, (912), 581 states have internal predecessors, (912), 3 states have call successors, (3), 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 607 states. [2022-04-08 08:46:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:38,676 INFO L93 Difference]: Finished difference Result 607 states and 943 transitions. [2022-04-08 08:46:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 943 transitions. [2022-04-08 08:46:38,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:38,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:38,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:38,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 581 states have (on average 1.5697074010327023) internal successors, (912), 581 states have internal predecessors, (912), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 916 transitions. [2022-04-08 08:46:38,700 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 916 transitions. Word has length 67 [2022-04-08 08:46:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:38,700 INFO L478 AbstractCegarLoop]: Abstraction has 586 states and 916 transitions. [2022-04-08 08:46:38,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:38,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 586 states and 916 transitions. [2022-04-08 08:46:41,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 916 edges. 915 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 916 transitions. [2022-04-08 08:46:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 08:46:41,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:41,554 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:41,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:46:41,554 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1303488414, now seen corresponding path program 1 times [2022-04-08 08:46:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:41,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907506180] [2022-04-08 08:46:41,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:41,601 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:41,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1303488414, now seen corresponding path program 2 times [2022-04-08 08:46:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:41,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391607028] [2022-04-08 08:46:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:41,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:41,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {34077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {34070#true} is VALID [2022-04-08 08:46:41,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {34070#true} assume true; {34070#true} is VALID [2022-04-08 08:46:41,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34070#true} {34070#true} #710#return; {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {34070#true} call ULTIMATE.init(); {34077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {34077#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {34070#true} assume true; {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34070#true} {34070#true} #710#return; {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {34070#true} call #t~ret161 := main(); {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {34070#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {34070#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L272 TraceCheckUtils]: 7: Hoare triple {34070#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {34070#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {34070#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {34070#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {34070#true} is VALID [2022-04-08 08:46:41,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {34070#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {34070#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {34070#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {34070#true} assume !false; {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {34070#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {34070#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {34070#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {34070#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {34070#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {34070#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {34070#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {34070#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {34070#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {34070#true} assume 8464 == #t~mem55;havoc #t~mem55; {34070#true} is VALID [2022-04-08 08:46:41,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {34070#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {34070#true} is VALID [2022-04-08 08:46:41,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {34070#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {34070#true} is VALID [2022-04-08 08:46:41,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {34070#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:46:41,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {34075#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34076#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {34076#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {34071#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {34071#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {34071#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {34071#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {34071#false} ~skip~0 := 0; {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {34071#false} assume !false; {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {34071#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {34071#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 47: Hoare triple {34071#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {34071#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {34071#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {34071#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {34071#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {34071#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {34071#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {34071#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {34071#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {34071#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {34071#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {34071#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {34071#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 60: Hoare triple {34071#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {34071#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 62: Hoare triple {34071#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {34071#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {34071#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {34071#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {34071#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {34071#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {34071#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 69: Hoare triple {34071#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {34071#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {34071#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 72: Hoare triple {34071#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {34071#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {34071#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 75: Hoare triple {34071#false} assume 8641 == #t~mem76;havoc #t~mem76; {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {34071#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {34071#false} assume !(9 == ~blastFlag~0); {34071#false} is VALID [2022-04-08 08:46:41,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {34071#false} assume 12 == ~blastFlag~0; {34071#false} is VALID [2022-04-08 08:46:41,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {34071#false} assume !false; {34071#false} is VALID [2022-04-08 08:46:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:46:41,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:41,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391607028] [2022-04-08 08:46:41,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391607028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:41,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:41,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:41,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:41,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907506180] [2022-04-08 08:46:41,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907506180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:41,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:41,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834763366] [2022-04-08 08:46:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:41,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 08:46:41,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:41,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:41,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:41,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:41,885 INFO L87 Difference]: Start difference. First operand 586 states and 916 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:43,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:46:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:47,841 INFO L93 Difference]: Finished difference Result 1546 states and 2430 transitions. [2022-04-08 08:46:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:46:47,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 08:46:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-08 08:46:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-08 08:46:47,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 614 transitions. [2022-04-08 08:46:48,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:48,285 INFO L225 Difference]: With dead ends: 1546 [2022-04-08 08:46:48,285 INFO L226 Difference]: Without dead ends: 986 [2022-04-08 08:46:48,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:46:48,286 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 153 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:46:48,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 384 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 08:46:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-04-08 08:46:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 630. [2022-04-08 08:46:48,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:48,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand has 630 states, 625 states have (on average 1.5696) internal successors, (981), 625 states have internal predecessors, (981), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:48,354 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand has 630 states, 625 states have (on average 1.5696) internal successors, (981), 625 states have internal predecessors, (981), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:48,355 INFO L87 Difference]: Start difference. First operand 986 states. Second operand has 630 states, 625 states have (on average 1.5696) internal successors, (981), 625 states have internal predecessors, (981), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:48,398 INFO L93 Difference]: Finished difference Result 986 states and 1541 transitions. [2022-04-08 08:46:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1541 transitions. [2022-04-08 08:46:48,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:48,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:48,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 630 states, 625 states have (on average 1.5696) internal successors, (981), 625 states have internal predecessors, (981), 3 states have call successors, (3), 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 986 states. [2022-04-08 08:46:48,400 INFO L87 Difference]: Start difference. First operand has 630 states, 625 states have (on average 1.5696) internal successors, (981), 625 states have internal predecessors, (981), 3 states have call successors, (3), 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 986 states. [2022-04-08 08:46:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:48,427 INFO L93 Difference]: Finished difference Result 986 states and 1541 transitions. [2022-04-08 08:46:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1541 transitions. [2022-04-08 08:46:48,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:48,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:48,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:48,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 625 states have (on average 1.5696) internal successors, (981), 625 states have internal predecessors, (981), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 985 transitions. [2022-04-08 08:46:48,464 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 985 transitions. Word has length 80 [2022-04-08 08:46:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:48,464 INFO L478 AbstractCegarLoop]: Abstraction has 630 states and 985 transitions. [2022-04-08 08:46:48,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:48,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 630 states and 985 transitions. [2022-04-08 08:46:51,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 985 edges. 984 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 985 transitions. [2022-04-08 08:46:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 08:46:51,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:51,520 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:46:51,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:46:51,520 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:51,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash -209098950, now seen corresponding path program 1 times [2022-04-08 08:46:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:51,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648257089] [2022-04-08 08:46:51,549 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:46:51,549 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:46:51,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash -209098950, now seen corresponding path program 2 times [2022-04-08 08:46:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:51,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885848230] [2022-04-08 08:46:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:51,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {40413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {40406#true} is VALID [2022-04-08 08:46:51,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {40406#true} assume true; {40406#true} is VALID [2022-04-08 08:46:51,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40406#true} {40406#true} #710#return; {40406#true} is VALID [2022-04-08 08:46:51,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {40406#true} call ULTIMATE.init(); {40413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:46:51,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {40413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {40406#true} is VALID [2022-04-08 08:46:51,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {40406#true} assume true; {40406#true} is VALID [2022-04-08 08:46:51,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40406#true} {40406#true} #710#return; {40406#true} is VALID [2022-04-08 08:46:51,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {40406#true} call #t~ret161 := main(); {40406#true} is VALID [2022-04-08 08:46:51,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {40406#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40406#true} is VALID [2022-04-08 08:46:51,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {40406#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,733 INFO L272 TraceCheckUtils]: 7: Hoare triple {40406#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {40406#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {40406#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {40406#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {40406#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {40406#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {40406#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {40406#true} assume !false; {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {40406#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {40406#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {40406#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {40406#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {40406#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {40406#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {40406#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {40406#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {40406#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {40406#true} assume 8464 == #t~mem55;havoc #t~mem55; {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {40406#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {40406#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {40406#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {40406#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {40406#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {40406#true} ~skip~0 := 0; {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {40406#true} assume !false; {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {40406#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {40406#true} assume 12292 == #t~mem47;havoc #t~mem47; {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {40406#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {40406#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {40406#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {40406#true} is VALID [2022-04-08 08:46:51,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {40406#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {40406#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {40406#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {40406#true} is VALID [2022-04-08 08:46:51,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {40406#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {40406#true} is VALID [2022-04-08 08:46:51,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {40406#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:46:51,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {40411#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40412#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {40412#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {40407#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {40407#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {40407#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 56: Hoare triple {40407#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {40407#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {40407#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {40407#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 60: Hoare triple {40407#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {40407#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {40407#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 63: Hoare triple {40407#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {40407#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 65: Hoare triple {40407#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {40407#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 67: Hoare triple {40407#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 68: Hoare triple {40407#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 69: Hoare triple {40407#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 70: Hoare triple {40407#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {40407#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {40407#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 73: Hoare triple {40407#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {40407#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {40407#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {40407#false} assume 8641 == #t~mem76;havoc #t~mem76; {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 77: Hoare triple {40407#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 78: Hoare triple {40407#false} assume !(9 == ~blastFlag~0); {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 79: Hoare triple {40407#false} assume 12 == ~blastFlag~0; {40407#false} is VALID [2022-04-08 08:46:51,742 INFO L290 TraceCheckUtils]: 80: Hoare triple {40407#false} assume !false; {40407#false} is VALID [2022-04-08 08:46:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:46:51,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:51,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885848230] [2022-04-08 08:46:51,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885848230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:51,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:51,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:51,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:51,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648257089] [2022-04-08 08:46:51,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648257089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:51,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:51,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:46:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917338233] [2022-04-08 08:46:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-08 08:46:51,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:51,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:46:51,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:46:51,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:46:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:46:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:46:51,800 INFO L87 Difference]: Start difference. First operand 630 states and 985 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:03,396 INFO L93 Difference]: Finished difference Result 1093 states and 1704 transitions. [2022-04-08 08:47:03,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:03,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-08 08:47:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-08 08:47:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-08 08:47:03,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-08 08:47:03,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:03,739 INFO L225 Difference]: With dead ends: 1093 [2022-04-08 08:47:03,739 INFO L226 Difference]: Without dead ends: 663 [2022-04-08 08:47:03,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:03,740 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 21 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:03,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 594 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:47:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-04-08 08:47:03,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 630. [2022-04-08 08:47:03,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:03,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 663 states. Second operand has 630 states, 625 states have (on average 1.5664) internal successors, (979), 625 states have internal predecessors, (979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,765 INFO L74 IsIncluded]: Start isIncluded. First operand 663 states. Second operand has 630 states, 625 states have (on average 1.5664) internal successors, (979), 625 states have internal predecessors, (979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,766 INFO L87 Difference]: Start difference. First operand 663 states. Second operand has 630 states, 625 states have (on average 1.5664) internal successors, (979), 625 states have internal predecessors, (979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:03,781 INFO L93 Difference]: Finished difference Result 663 states and 1024 transitions. [2022-04-08 08:47:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1024 transitions. [2022-04-08 08:47:03,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:03,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:03,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 630 states, 625 states have (on average 1.5664) internal successors, (979), 625 states have internal predecessors, (979), 3 states have call successors, (3), 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 663 states. [2022-04-08 08:47:03,783 INFO L87 Difference]: Start difference. First operand has 630 states, 625 states have (on average 1.5664) internal successors, (979), 625 states have internal predecessors, (979), 3 states have call successors, (3), 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 663 states. [2022-04-08 08:47:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:03,797 INFO L93 Difference]: Finished difference Result 663 states and 1024 transitions. [2022-04-08 08:47:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1024 transitions. [2022-04-08 08:47:03,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:03,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:03,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:03,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 625 states have (on average 1.5664) internal successors, (979), 625 states have internal predecessors, (979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 983 transitions. [2022-04-08 08:47:03,815 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 983 transitions. Word has length 81 [2022-04-08 08:47:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:03,815 INFO L478 AbstractCegarLoop]: Abstraction has 630 states and 983 transitions. [2022-04-08 08:47:03,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:03,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 630 states and 983 transitions. [2022-04-08 08:47:06,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 983 edges. 982 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 983 transitions. [2022-04-08 08:47:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 08:47:06,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:06,727 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:06,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:47:06,727 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1502155963, now seen corresponding path program 1 times [2022-04-08 08:47:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:06,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119163306] [2022-04-08 08:47:06,748 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:06,756 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:06,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1502155963, now seen corresponding path program 2 times [2022-04-08 08:47:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:06,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733357533] [2022-04-08 08:47:06,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:06,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:06,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {45197#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {45190#true} is VALID [2022-04-08 08:47:06,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {45190#true} assume true; {45190#true} is VALID [2022-04-08 08:47:06,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45190#true} {45190#true} #710#return; {45190#true} is VALID [2022-04-08 08:47:06,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {45190#true} call ULTIMATE.init(); {45197#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:06,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {45197#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {45190#true} is VALID [2022-04-08 08:47:06,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {45190#true} assume true; {45190#true} is VALID [2022-04-08 08:47:06,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45190#true} {45190#true} #710#return; {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {45190#true} call #t~ret161 := main(); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {45190#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {45190#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L272 TraceCheckUtils]: 7: Hoare triple {45190#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {45190#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {45190#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {45190#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {45190#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {45190#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {45190#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {45190#true} assume !false; {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {45190#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {45190#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {45190#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {45190#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {45190#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {45190#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {45190#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {45190#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {45190#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {45190#true} assume 8464 == #t~mem55;havoc #t~mem55; {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {45190#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45190#true} is VALID [2022-04-08 08:47:06,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {45190#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45190#true} is VALID [2022-04-08 08:47:06,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {45190#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:06,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {45195#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45196#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {45196#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {45191#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {45191#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {45191#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {45191#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {45191#false} ~skip~0 := 0; {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {45191#false} assume !false; {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {45191#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {45191#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {45191#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {45191#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {45191#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {45191#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {45191#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {45191#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {45191#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {45191#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {45191#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {45191#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {45191#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {45191#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {45191#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {45191#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {45191#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {45191#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {45191#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {45191#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {45191#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {45191#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {45191#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {45191#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {45191#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {45191#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {45191#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {45191#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {45191#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {45191#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {45191#false} is VALID [2022-04-08 08:47:06,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {45191#false} assume 8641 == #t~mem76;havoc #t~mem76; {45191#false} is VALID [2022-04-08 08:47:06,945 INFO L290 TraceCheckUtils]: 77: Hoare triple {45191#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {45191#false} is VALID [2022-04-08 08:47:06,945 INFO L290 TraceCheckUtils]: 78: Hoare triple {45191#false} assume !(9 == ~blastFlag~0); {45191#false} is VALID [2022-04-08 08:47:06,945 INFO L290 TraceCheckUtils]: 79: Hoare triple {45191#false} assume 12 == ~blastFlag~0; {45191#false} is VALID [2022-04-08 08:47:06,945 INFO L290 TraceCheckUtils]: 80: Hoare triple {45191#false} assume !false; {45191#false} is VALID [2022-04-08 08:47:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:47:06,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:06,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733357533] [2022-04-08 08:47:06,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733357533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:06,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:06,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:06,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:06,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119163306] [2022-04-08 08:47:06,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119163306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:06,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:06,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:06,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078422298] [2022-04-08 08:47:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:06,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-08 08:47:06,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:06,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:07,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:07,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:07,006 INFO L87 Difference]: Start difference. First operand 630 states and 983 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:09,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:12,956 INFO L93 Difference]: Finished difference Result 873 states and 1367 transitions. [2022-04-08 08:47:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-08 08:47:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-08 08:47:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-08 08:47:12,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-08 08:47:13,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:13,307 INFO L225 Difference]: With dead ends: 873 [2022-04-08 08:47:13,307 INFO L226 Difference]: Without dead ends: 649 [2022-04-08 08:47:13,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:13,308 INFO L913 BasicCegarLoop]: 246 mSDtfsCounter, 36 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:13,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 611 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 443 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 08:47:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-04-08 08:47:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 630. [2022-04-08 08:47:13,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:13,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 630 states, 625 states have (on average 1.5648) internal successors, (978), 625 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:13,328 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 630 states, 625 states have (on average 1.5648) internal successors, (978), 625 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:13,329 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 630 states, 625 states have (on average 1.5648) internal successors, (978), 625 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:13,341 INFO L93 Difference]: Finished difference Result 649 states and 1007 transitions. [2022-04-08 08:47:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-08 08:47:13,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:13,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:13,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 630 states, 625 states have (on average 1.5648) internal successors, (978), 625 states have internal predecessors, (978), 3 states have call successors, (3), 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 649 states. [2022-04-08 08:47:13,343 INFO L87 Difference]: Start difference. First operand has 630 states, 625 states have (on average 1.5648) internal successors, (978), 625 states have internal predecessors, (978), 3 states have call successors, (3), 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 649 states. [2022-04-08 08:47:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:13,355 INFO L93 Difference]: Finished difference Result 649 states and 1007 transitions. [2022-04-08 08:47:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-08 08:47:13,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:13,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:13,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:13,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 625 states have (on average 1.5648) internal successors, (978), 625 states have internal predecessors, (978), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 982 transitions. [2022-04-08 08:47:13,370 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 982 transitions. Word has length 81 [2022-04-08 08:47:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:13,370 INFO L478 AbstractCegarLoop]: Abstraction has 630 states and 982 transitions. [2022-04-08 08:47:13,371 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:13,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 630 states and 982 transitions. [2022-04-08 08:47:16,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 982 edges. 981 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 982 transitions. [2022-04-08 08:47:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 08:47:16,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:16,401 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:16,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:47:16,401 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1434595962, now seen corresponding path program 1 times [2022-04-08 08:47:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:16,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198854533] [2022-04-08 08:47:16,425 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:16,425 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:16,425 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1434595962, now seen corresponding path program 2 times [2022-04-08 08:47:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:16,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353411633] [2022-04-08 08:47:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:16,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {49513#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {49506#true} is VALID [2022-04-08 08:47:16,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {49506#true} assume true; {49506#true} is VALID [2022-04-08 08:47:16,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49506#true} {49506#true} #710#return; {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {49506#true} call ULTIMATE.init(); {49513#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:16,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {49513#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {49506#true} assume true; {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49506#true} {49506#true} #710#return; {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {49506#true} call #t~ret161 := main(); {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {49506#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {49506#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L272 TraceCheckUtils]: 7: Hoare triple {49506#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49506#true} is VALID [2022-04-08 08:47:16,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {49506#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {49506#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {49506#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {49506#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {49506#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {49506#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {49506#true} assume !false; {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {49506#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {49506#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {49506#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {49506#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {49506#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {49506#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {49506#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {49506#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {49506#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49506#true} is VALID [2022-04-08 08:47:16,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {49506#true} assume 8464 == #t~mem55;havoc #t~mem55; {49506#true} is VALID [2022-04-08 08:47:16,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {49506#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {49506#true} is VALID [2022-04-08 08:47:16,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {49506#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49506#true} is VALID [2022-04-08 08:47:16,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {49506#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:47:16,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {49511#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49512#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-08 08:47:16,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {49512#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {49507#false} is VALID [2022-04-08 08:47:16,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {49507#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {49507#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {49507#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {49507#false} ~skip~0 := 0; {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {49507#false} assume !false; {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {49507#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {49507#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {49507#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {49507#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {49507#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {49507#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {49507#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {49507#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {49507#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {49507#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {49507#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {49507#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {49507#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {49507#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {49507#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {49507#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {49507#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {49507#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {49507#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {49507#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {49507#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {49507#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {49507#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {49507#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {49507#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {49507#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {49507#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 73: Hoare triple {49507#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 74: Hoare triple {49507#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {49507#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {49507#false} assume 8641 == #t~mem76;havoc #t~mem76; {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {49507#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 78: Hoare triple {49507#false} assume !(9 == ~blastFlag~0); {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 79: Hoare triple {49507#false} assume 12 == ~blastFlag~0; {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L290 TraceCheckUtils]: 80: Hoare triple {49507#false} assume !false; {49507#false} is VALID [2022-04-08 08:47:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:47:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353411633] [2022-04-08 08:47:16,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353411633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:16,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:16,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:16,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198854533] [2022-04-08 08:47:16,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198854533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:16,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:16,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951661328] [2022-04-08 08:47:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-08 08:47:16,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:16,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:16,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:16,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:16,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:16,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:16,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:16,668 INFO L87 Difference]: Start difference. First operand 630 states and 982 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:20,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:31,935 INFO L93 Difference]: Finished difference Result 1541 states and 2393 transitions. [2022-04-08 08:47:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:47:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-08 08:47:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-08 08:47:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-08 08:47:31,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 613 transitions. [2022-04-08 08:47:32,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:32,414 INFO L225 Difference]: With dead ends: 1541 [2022-04-08 08:47:32,415 INFO L226 Difference]: Without dead ends: 937 [2022-04-08 08:47:32,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:32,416 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:32,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 364 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-08 08:47:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-04-08 08:47:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 636. [2022-04-08 08:47:32,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:32,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 937 states. Second operand has 636 states, 631 states have (on average 1.5562599049128367) internal successors, (982), 631 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:32,441 INFO L74 IsIncluded]: Start isIncluded. First operand 937 states. Second operand has 636 states, 631 states have (on average 1.5562599049128367) internal successors, (982), 631 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:32,441 INFO L87 Difference]: Start difference. First operand 937 states. Second operand has 636 states, 631 states have (on average 1.5562599049128367) internal successors, (982), 631 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:32,466 INFO L93 Difference]: Finished difference Result 937 states and 1437 transitions. [2022-04-08 08:47:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1437 transitions. [2022-04-08 08:47:32,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:32,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:32,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 636 states, 631 states have (on average 1.5562599049128367) internal successors, (982), 631 states have internal predecessors, (982), 3 states have call successors, (3), 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 937 states. [2022-04-08 08:47:32,468 INFO L87 Difference]: Start difference. First operand has 636 states, 631 states have (on average 1.5562599049128367) internal successors, (982), 631 states have internal predecessors, (982), 3 states have call successors, (3), 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 937 states. [2022-04-08 08:47:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:32,492 INFO L93 Difference]: Finished difference Result 937 states and 1437 transitions. [2022-04-08 08:47:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1437 transitions. [2022-04-08 08:47:32,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:32,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:32,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:32,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 631 states have (on average 1.5562599049128367) internal successors, (982), 631 states have internal predecessors, (982), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 986 transitions. [2022-04-08 08:47:32,524 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 986 transitions. Word has length 81 [2022-04-08 08:47:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:32,525 INFO L478 AbstractCegarLoop]: Abstraction has 636 states and 986 transitions. [2022-04-08 08:47:32,525 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:32,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 636 states and 986 transitions. [2022-04-08 08:47:35,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 986 edges. 985 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 986 transitions. [2022-04-08 08:47:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 08:47:35,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:35,601 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:35,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:47:35,601 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -57648593, now seen corresponding path program 1 times [2022-04-08 08:47:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:35,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [756964821] [2022-04-08 08:47:35,625 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:35,625 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:35,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash -57648593, now seen corresponding path program 2 times [2022-04-08 08:47:35,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:35,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040386549] [2022-04-08 08:47:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:35,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:35,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {55754#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {55746#true} is VALID [2022-04-08 08:47:35,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {55746#true} assume true; {55746#true} is VALID [2022-04-08 08:47:35,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55746#true} {55746#true} #710#return; {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {55746#true} call ULTIMATE.init(); {55754#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {55754#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {55746#true} assume true; {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55746#true} {55746#true} #710#return; {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {55746#true} call #t~ret161 := main(); {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {55746#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {55746#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L272 TraceCheckUtils]: 7: Hoare triple {55746#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {55746#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {55746#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {55746#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {55746#true} is VALID [2022-04-08 08:47:35,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {55746#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {55746#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {55746#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {55746#true} assume !false; {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {55746#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {55746#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {55746#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {55746#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {55746#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {55746#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {55746#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {55746#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {55746#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {55746#true} assume 8464 == #t~mem55;havoc #t~mem55; {55746#true} is VALID [2022-04-08 08:47:35,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {55746#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {55746#true} is VALID [2022-04-08 08:47:35,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {55746#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55746#true} is VALID [2022-04-08 08:47:35,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {55746#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {55746#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {55746#true} is VALID [2022-04-08 08:47:35,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {55746#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55746#true} is VALID [2022-04-08 08:47:35,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {55746#true} ~skip~0 := 0; {55746#true} is VALID [2022-04-08 08:47:35,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {55746#true} assume !false; {55746#true} is VALID [2022-04-08 08:47:35,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {55746#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {55751#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {55751#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:35,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {55752#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {55753#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-08 08:47:35,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {55753#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {55747#false} is VALID [2022-04-08 08:47:35,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {55747#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {55747#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {55747#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {55747#false} ~skip~0 := 0; {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {55747#false} assume !false; {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {55747#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {55747#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {55747#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {55747#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {55747#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {55747#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {55747#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {55747#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {55747#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {55747#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {55747#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 58: Hoare triple {55747#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 59: Hoare triple {55747#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 60: Hoare triple {55747#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {55747#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {55747#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {55747#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {55747#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {55747#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {55747#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {55747#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {55747#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {55747#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {55747#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 71: Hoare triple {55747#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 72: Hoare triple {55747#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 73: Hoare triple {55747#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {55747#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 75: Hoare triple {55747#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {55747#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {55747#false} assume 8641 == #t~mem76;havoc #t~mem76; {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {55747#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {55747#false} assume !(9 == ~blastFlag~0); {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {55747#false} assume 12 == ~blastFlag~0; {55747#false} is VALID [2022-04-08 08:47:35,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {55747#false} assume !false; {55747#false} is VALID [2022-04-08 08:47:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:47:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040386549] [2022-04-08 08:47:35,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040386549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:35,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:35,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:47:35,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [756964821] [2022-04-08 08:47:35,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [756964821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:35,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:35,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:47:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692087609] [2022-04-08 08:47:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:35,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-08 08:47:35,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:35,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:35,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:35,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:47:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:47:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:47:35,973 INFO L87 Difference]: Start difference. First operand 636 states and 986 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:39,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:41,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:43,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:51,338 INFO L93 Difference]: Finished difference Result 1088 states and 1688 transitions. [2022-04-08 08:47:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:47:51,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-08 08:47:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2022-04-08 08:47:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2022-04-08 08:47:51,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 435 transitions. [2022-04-08 08:47:51,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:51,649 INFO L225 Difference]: With dead ends: 1088 [2022-04-08 08:47:51,649 INFO L226 Difference]: Without dead ends: 654 [2022-04-08 08:47:51,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:47:51,651 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:47:51,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 682 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-04-08 08:47:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-04-08 08:47:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2022-04-08 08:47:51,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:51,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 654 states. Second operand has 654 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 649 states have internal predecessors, (1004), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,710 INFO L74 IsIncluded]: Start isIncluded. First operand 654 states. Second operand has 654 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 649 states have internal predecessors, (1004), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,710 INFO L87 Difference]: Start difference. First operand 654 states. Second operand has 654 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 649 states have internal predecessors, (1004), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:51,722 INFO L93 Difference]: Finished difference Result 654 states and 1008 transitions. [2022-04-08 08:47:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1008 transitions. [2022-04-08 08:47:51,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:51,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:51,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 654 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 649 states have internal predecessors, (1004), 3 states have call successors, (3), 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 654 states. [2022-04-08 08:47:51,731 INFO L87 Difference]: Start difference. First operand has 654 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 649 states have internal predecessors, (1004), 3 states have call successors, (3), 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 654 states. [2022-04-08 08:47:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:51,755 INFO L93 Difference]: Finished difference Result 654 states and 1008 transitions. [2022-04-08 08:47:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1008 transitions. [2022-04-08 08:47:51,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:51,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:51,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:51,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 649 states have internal predecessors, (1004), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1008 transitions. [2022-04-08 08:47:51,793 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1008 transitions. Word has length 82 [2022-04-08 08:47:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:51,794 INFO L478 AbstractCegarLoop]: Abstraction has 654 states and 1008 transitions. [2022-04-08 08:47:51,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:51,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 654 states and 1008 transitions. [2022-04-08 08:47:54,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1008 edges. 1007 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1008 transitions. [2022-04-08 08:47:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 08:47:54,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:54,822 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:47:54,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:47:54,822 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 421308226, now seen corresponding path program 1 times [2022-04-08 08:47:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:54,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035146130] [2022-04-08 08:47:54,852 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:47:54,852 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:47:54,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:47:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash 421308226, now seen corresponding path program 2 times [2022-04-08 08:47:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:47:54,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222575505] [2022-04-08 08:47:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:47:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:47:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:47:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:55,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {60558#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {60551#true} is VALID [2022-04-08 08:47:55,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {60551#true} assume true; {60551#true} is VALID [2022-04-08 08:47:55,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60551#true} {60551#true} #710#return; {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {60551#true} call ULTIMATE.init(); {60558#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:47:55,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {60558#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {60551#true} assume true; {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60551#true} {60551#true} #710#return; {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {60551#true} call #t~ret161 := main(); {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {60551#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {60551#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L272 TraceCheckUtils]: 7: Hoare triple {60551#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {60551#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {60551#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {60551#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {60551#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {60551#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {60551#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {60551#true} assume !false; {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {60551#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {60551#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {60551#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {60551#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {60551#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {60551#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {60551#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {60551#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {60551#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60551#true} is VALID [2022-04-08 08:47:55,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {60551#true} assume 8464 == #t~mem55;havoc #t~mem55; {60551#true} is VALID [2022-04-08 08:47:55,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {60551#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {60551#true} is VALID [2022-04-08 08:47:55,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {60551#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60551#true} is VALID [2022-04-08 08:47:55,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {60551#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:55,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:55,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:55,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:55,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:55,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:55,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:47:55,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {60556#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60557#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-08 08:47:55,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {60557#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {60552#false} is VALID [2022-04-08 08:47:55,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {60552#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {60552#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {60552#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {60552#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {60552#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {60552#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {60552#false} assume 12292 != #t~mem85;havoc #t~mem85; {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {60552#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {60552#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {60552#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {60552#false} ~skip~0 := 0; {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {60552#false} assume !false; {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {60552#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {60552#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {60552#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {60552#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {60552#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {60552#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {60552#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {60552#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {60552#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 57: Hoare triple {60552#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {60552#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {60552#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {60552#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {60552#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {60552#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {60552#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {60552#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {60552#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {60552#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {60552#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {60552#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {60552#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {60552#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {60552#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {60552#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 73: Hoare triple {60552#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 74: Hoare triple {60552#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 75: Hoare triple {60552#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 76: Hoare triple {60552#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 77: Hoare triple {60552#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {60552#false} assume 8641 == #t~mem76;havoc #t~mem76; {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 79: Hoare triple {60552#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {60552#false} is VALID [2022-04-08 08:47:55,062 INFO L290 TraceCheckUtils]: 80: Hoare triple {60552#false} assume !(9 == ~blastFlag~0); {60552#false} is VALID [2022-04-08 08:47:55,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {60552#false} assume 12 == ~blastFlag~0; {60552#false} is VALID [2022-04-08 08:47:55,063 INFO L290 TraceCheckUtils]: 82: Hoare triple {60552#false} assume !false; {60552#false} is VALID [2022-04-08 08:47:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:47:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:47:55,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222575505] [2022-04-08 08:47:55,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222575505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:55,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:55,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:55,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:55,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035146130] [2022-04-08 08:47:55,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035146130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:55,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:55,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:47:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634088124] [2022-04-08 08:47:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:55,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 08:47:55,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:55,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:55,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:47:55,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:47:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:47:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:47:55,120 INFO L87 Difference]: Start difference. First operand 654 states and 1008 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:47:57,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:47:58,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:06,535 INFO L93 Difference]: Finished difference Result 916 states and 1413 transitions. [2022-04-08 08:48:06,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:06,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-08 08:48:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-08 08:48:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2022-04-08 08:48:06,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 481 transitions. [2022-04-08 08:48:06,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 481 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:06,876 INFO L225 Difference]: With dead ends: 916 [2022-04-08 08:48:06,876 INFO L226 Difference]: Without dead ends: 681 [2022-04-08 08:48:06,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:06,877 INFO L913 BasicCegarLoop]: 244 mSDtfsCounter, 38 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:06,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 607 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-08 08:48:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-04-08 08:48:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 654. [2022-04-08 08:48:06,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:06,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 681 states. Second operand has 654 states, 649 states have (on average 1.5454545454545454) internal successors, (1003), 649 states have internal predecessors, (1003), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,900 INFO L74 IsIncluded]: Start isIncluded. First operand 681 states. Second operand has 654 states, 649 states have (on average 1.5454545454545454) internal successors, (1003), 649 states have internal predecessors, (1003), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,900 INFO L87 Difference]: Start difference. First operand 681 states. Second operand has 654 states, 649 states have (on average 1.5454545454545454) internal successors, (1003), 649 states have internal predecessors, (1003), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:06,913 INFO L93 Difference]: Finished difference Result 681 states and 1042 transitions. [2022-04-08 08:48:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1042 transitions. [2022-04-08 08:48:06,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:06,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:06,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 654 states, 649 states have (on average 1.5454545454545454) internal successors, (1003), 649 states have internal predecessors, (1003), 3 states have call successors, (3), 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 681 states. [2022-04-08 08:48:06,915 INFO L87 Difference]: Start difference. First operand has 654 states, 649 states have (on average 1.5454545454545454) internal successors, (1003), 649 states have internal predecessors, (1003), 3 states have call successors, (3), 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 681 states. [2022-04-08 08:48:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:06,927 INFO L93 Difference]: Finished difference Result 681 states and 1042 transitions. [2022-04-08 08:48:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1042 transitions. [2022-04-08 08:48:06,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:06,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:06,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:06,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 649 states have (on average 1.5454545454545454) internal successors, (1003), 649 states have internal predecessors, (1003), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1007 transitions. [2022-04-08 08:48:06,952 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1007 transitions. Word has length 83 [2022-04-08 08:48:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:06,952 INFO L478 AbstractCegarLoop]: Abstraction has 654 states and 1007 transitions. [2022-04-08 08:48:06,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:06,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 654 states and 1007 transitions. [2022-04-08 08:48:09,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1007 edges. 1006 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1007 transitions. [2022-04-08 08:48:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 08:48:09,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:09,967 INFO L499 BasicCegarLoop]: 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] [2022-04-08 08:48:09,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:48:09,967 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2098994774, now seen corresponding path program 1 times [2022-04-08 08:48:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:09,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338683565] [2022-04-08 08:48:09,996 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:09,996 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:09,996 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2098994774, now seen corresponding path program 2 times [2022-04-08 08:48:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:09,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625126055] [2022-04-08 08:48:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:10,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {65072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {65065#true} is VALID [2022-04-08 08:48:10,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {65065#true} assume true; {65065#true} is VALID [2022-04-08 08:48:10,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65065#true} {65065#true} #710#return; {65065#true} is VALID [2022-04-08 08:48:10,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {65065#true} call ULTIMATE.init(); {65072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {65072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {65065#true} assume true; {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65065#true} {65065#true} #710#return; {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {65065#true} call #t~ret161 := main(); {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {65065#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {65065#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L272 TraceCheckUtils]: 7: Hoare triple {65065#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {65065#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {65065#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {65065#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {65065#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {65065#true} is VALID [2022-04-08 08:48:10,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {65065#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {65065#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {65065#true} assume !false; {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {65065#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {65065#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {65065#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {65065#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {65065#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {65065#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {65065#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {65065#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {65065#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {65065#true} assume 8464 == #t~mem55;havoc #t~mem55; {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {65065#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {65065#true} is VALID [2022-04-08 08:48:10,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {65065#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {65065#true} is VALID [2022-04-08 08:48:10,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {65065#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:10,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {65070#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65071#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 08:48:10,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {65071#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {65066#false} is VALID [2022-04-08 08:48:10,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {65066#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {65066#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {65066#false} is VALID [2022-04-08 08:48:10,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {65066#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {65066#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {65066#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {65066#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {65066#false} assume 12292 != #t~mem85;havoc #t~mem85; {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {65066#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {65066#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {65066#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {65066#false} ~skip~0 := 0; {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {65066#false} assume !false; {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {65066#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {65066#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {65066#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {65066#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {65066#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {65066#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {65066#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {65066#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {65066#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {65066#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 59: Hoare triple {65066#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {65066#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {65066#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {65066#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {65066#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {65066#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {65066#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {65066#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {65066#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {65066#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {65066#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 70: Hoare triple {65066#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {65066#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {65066#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {65066#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {65066#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {65066#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {65066#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {65066#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {65066#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {65066#false} assume 8641 == #t~mem76;havoc #t~mem76; {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {65066#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {65066#false} assume !(9 == ~blastFlag~0); {65066#false} is VALID [2022-04-08 08:48:10,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {65066#false} assume 12 == ~blastFlag~0; {65066#false} is VALID [2022-04-08 08:48:10,212 INFO L290 TraceCheckUtils]: 83: Hoare triple {65066#false} assume !false; {65066#false} is VALID [2022-04-08 08:48:10,212 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-08 08:48:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625126055] [2022-04-08 08:48:10,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625126055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:10,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:10,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:10,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338683565] [2022-04-08 08:48:10,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338683565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:10,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:10,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572606639] [2022-04-08 08:48:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:10,213 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-08 08:48:10,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:10,214 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-08 08:48:10,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:10,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:10,275 INFO L87 Difference]: Start difference. First operand 654 states and 1007 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-08 08:48:12,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:16,321 INFO L93 Difference]: Finished difference Result 1423 states and 2176 transitions. [2022-04-08 08:48:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:16,321 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-08 08:48:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:16,321 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-08 08:48:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-08 08:48:16,324 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-08 08:48:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-08 08:48:16,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 612 transitions. [2022-04-08 08:48:16,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:16,750 INFO L225 Difference]: With dead ends: 1423 [2022-04-08 08:48:16,750 INFO L226 Difference]: Without dead ends: 969 [2022-04-08 08:48:16,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:16,751 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 154 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:16,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 364 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 08:48:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-08 08:48:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 654. [2022-04-08 08:48:16,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:16,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 654 states, 649 states have (on average 1.5300462249614792) internal successors, (993), 649 states have internal predecessors, (993), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,779 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 654 states, 649 states have (on average 1.5300462249614792) internal successors, (993), 649 states have internal predecessors, (993), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,779 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 654 states, 649 states have (on average 1.5300462249614792) internal successors, (993), 649 states have internal predecessors, (993), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:16,805 INFO L93 Difference]: Finished difference Result 969 states and 1464 transitions. [2022-04-08 08:48:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1464 transitions. [2022-04-08 08:48:16,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:16,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:16,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 654 states, 649 states have (on average 1.5300462249614792) internal successors, (993), 649 states have internal predecessors, (993), 3 states have call successors, (3), 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 969 states. [2022-04-08 08:48:16,808 INFO L87 Difference]: Start difference. First operand has 654 states, 649 states have (on average 1.5300462249614792) internal successors, (993), 649 states have internal predecessors, (993), 3 states have call successors, (3), 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 969 states. [2022-04-08 08:48:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:16,834 INFO L93 Difference]: Finished difference Result 969 states and 1464 transitions. [2022-04-08 08:48:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1464 transitions. [2022-04-08 08:48:16,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:16,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:16,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:16,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 649 states have (on average 1.5300462249614792) internal successors, (993), 649 states have internal predecessors, (993), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 997 transitions. [2022-04-08 08:48:16,852 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 997 transitions. Word has length 84 [2022-04-08 08:48:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:16,852 INFO L478 AbstractCegarLoop]: Abstraction has 654 states and 997 transitions. [2022-04-08 08:48:16,852 INFO L479 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-08 08:48:16,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 654 states and 997 transitions. [2022-04-08 08:48:19,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 997 edges. 996 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 997 transitions. [2022-04-08 08:48:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 08:48:19,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:19,897 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:19,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:48:19,897 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1174359267, now seen corresponding path program 1 times [2022-04-08 08:48:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:19,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426141263] [2022-04-08 08:48:19,931 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:19,931 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:19,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1174359267, now seen corresponding path program 2 times [2022-04-08 08:48:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499638728] [2022-04-08 08:48:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:20,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:20,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {71176#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {71169#true} is VALID [2022-04-08 08:48:20,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {71169#true} assume true; {71169#true} is VALID [2022-04-08 08:48:20,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71169#true} {71169#true} #710#return; {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {71169#true} call ULTIMATE.init(); {71176#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:20,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {71176#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {71169#true} assume true; {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71169#true} {71169#true} #710#return; {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {71169#true} call #t~ret161 := main(); {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {71169#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {71169#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L272 TraceCheckUtils]: 7: Hoare triple {71169#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {71169#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {71169#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {71169#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {71169#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {71169#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {71169#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {71169#true} assume !false; {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {71169#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {71169#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {71169#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {71169#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {71169#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {71169#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {71169#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {71169#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {71169#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71169#true} is VALID [2022-04-08 08:48:20,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {71169#true} assume 8464 == #t~mem55;havoc #t~mem55; {71169#true} is VALID [2022-04-08 08:48:20,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {71169#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {71169#true} is VALID [2022-04-08 08:48:20,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {71169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {71169#true} is VALID [2022-04-08 08:48:20,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {71169#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:20,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {71174#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71175#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 08:48:20,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {71175#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {71170#false} is VALID [2022-04-08 08:48:20,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {71170#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {71170#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {71170#false} is VALID [2022-04-08 08:48:20,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {71170#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {71170#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {71170#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {71170#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {71170#false} assume 12292 != #t~mem85;havoc #t~mem85; {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {71170#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {71170#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {71170#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {71170#false} ~skip~0 := 0; {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {71170#false} assume !false; {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {71170#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {71170#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {71170#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {71170#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 54: Hoare triple {71170#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,212 INFO L290 TraceCheckUtils]: 55: Hoare triple {71170#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {71170#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {71170#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 58: Hoare triple {71170#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 59: Hoare triple {71170#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {71170#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {71170#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {71170#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {71170#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 64: Hoare triple {71170#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 65: Hoare triple {71170#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 66: Hoare triple {71170#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 67: Hoare triple {71170#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {71170#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {71170#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {71170#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 71: Hoare triple {71170#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {71170#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {71170#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {71170#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {71170#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {71170#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {71170#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {71170#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {71170#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 80: Hoare triple {71170#false} assume 8641 == #t~mem76;havoc #t~mem76; {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {71170#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {71170#false} assume !(9 == ~blastFlag~0); {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 83: Hoare triple {71170#false} assume 12 == ~blastFlag~0; {71170#false} is VALID [2022-04-08 08:48:20,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {71170#false} assume !false; {71170#false} is VALID [2022-04-08 08:48:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:48:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499638728] [2022-04-08 08:48:20,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499638728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:20,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:20,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:20,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426141263] [2022-04-08 08:48:20,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426141263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:20,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:20,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:20,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803855219] [2022-04-08 08:48:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:20,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-08 08:48:20,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:20,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:20,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:20,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:20,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:20,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:20,289 INFO L87 Difference]: Start difference. First operand 654 states and 997 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:23,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:25,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:28,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:31,460 INFO L93 Difference]: Finished difference Result 1421 states and 2156 transitions. [2022-04-08 08:48:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-08 08:48:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-08 08:48:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-08 08:48:31,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 611 transitions. [2022-04-08 08:48:31,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:31,917 INFO L225 Difference]: With dead ends: 1421 [2022-04-08 08:48:31,917 INFO L226 Difference]: Without dead ends: 969 [2022-04-08 08:48:31,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:31,932 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 152 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:31,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 364 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-04-08 08:48:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-08 08:48:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 654. [2022-04-08 08:48:31,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:31,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 654 states, 649 states have (on average 1.5146379044684128) internal successors, (983), 649 states have internal predecessors, (983), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:31,980 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 654 states, 649 states have (on average 1.5146379044684128) internal successors, (983), 649 states have internal predecessors, (983), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:31,980 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 654 states, 649 states have (on average 1.5146379044684128) internal successors, (983), 649 states have internal predecessors, (983), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:32,006 INFO L93 Difference]: Finished difference Result 969 states and 1454 transitions. [2022-04-08 08:48:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1454 transitions. [2022-04-08 08:48:32,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:32,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:32,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 654 states, 649 states have (on average 1.5146379044684128) internal successors, (983), 649 states have internal predecessors, (983), 3 states have call successors, (3), 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 969 states. [2022-04-08 08:48:32,008 INFO L87 Difference]: Start difference. First operand has 654 states, 649 states have (on average 1.5146379044684128) internal successors, (983), 649 states have internal predecessors, (983), 3 states have call successors, (3), 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 969 states. [2022-04-08 08:48:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:32,034 INFO L93 Difference]: Finished difference Result 969 states and 1454 transitions. [2022-04-08 08:48:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1454 transitions. [2022-04-08 08:48:32,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:32,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:32,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:32,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 649 states have (on average 1.5146379044684128) internal successors, (983), 649 states have internal predecessors, (983), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 987 transitions. [2022-04-08 08:48:32,052 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 987 transitions. Word has length 85 [2022-04-08 08:48:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:32,052 INFO L478 AbstractCegarLoop]: Abstraction has 654 states and 987 transitions. [2022-04-08 08:48:32,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:32,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 654 states and 987 transitions. [2022-04-08 08:48:35,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 987 edges. 986 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 987 transitions. [2022-04-08 08:48:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 08:48:35,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:35,089 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:35,089 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:48:35,089 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1885346315, now seen corresponding path program 1 times [2022-04-08 08:48:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:35,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258659520] [2022-04-08 08:48:35,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:35,119 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:35,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1885346315, now seen corresponding path program 2 times [2022-04-08 08:48:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:35,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707788568] [2022-04-08 08:48:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:35,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:35,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {77276#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {77269#true} is VALID [2022-04-08 08:48:35,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {77269#true} assume true; {77269#true} is VALID [2022-04-08 08:48:35,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77269#true} {77269#true} #710#return; {77269#true} is VALID [2022-04-08 08:48:35,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {77269#true} call ULTIMATE.init(); {77276#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:35,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {77276#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {77269#true} is VALID [2022-04-08 08:48:35,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {77269#true} assume true; {77269#true} is VALID [2022-04-08 08:48:35,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77269#true} {77269#true} #710#return; {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {77269#true} call #t~ret161 := main(); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {77269#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {77269#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L272 TraceCheckUtils]: 7: Hoare triple {77269#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {77269#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {77269#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {77269#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {77269#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {77269#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {77269#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {77269#true} assume !false; {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {77269#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {77269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {77269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {77269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {77269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {77269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {77269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {77269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {77269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {77269#true} assume 8464 == #t~mem55;havoc #t~mem55; {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {77269#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {77269#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {77269#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {77269#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {77269#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {77269#true} ~skip~0 := 0; {77269#true} is VALID [2022-04-08 08:48:35,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {77269#true} assume !false; {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {77269#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {77269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {77269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {77269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {77269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {77269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {77269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {77269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {77269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {77269#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {77269#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {77269#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {77269#true} assume 8496 == #t~mem58;havoc #t~mem58; {77269#true} is VALID [2022-04-08 08:48:35,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {77269#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {77269#true} is VALID [2022-04-08 08:48:35,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {77269#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77269#true} is VALID [2022-04-08 08:48:35,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {77269#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {77269#true} is VALID [2022-04-08 08:48:35,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {77269#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,285 INFO L290 TraceCheckUtils]: 54: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,288 INFO L290 TraceCheckUtils]: 63: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,291 INFO L290 TraceCheckUtils]: 70: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,291 INFO L290 TraceCheckUtils]: 71: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,291 INFO L290 TraceCheckUtils]: 72: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,292 INFO L290 TraceCheckUtils]: 73: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,292 INFO L290 TraceCheckUtils]: 74: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,294 INFO L290 TraceCheckUtils]: 79: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,294 INFO L290 TraceCheckUtils]: 80: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,294 INFO L290 TraceCheckUtils]: 81: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,295 INFO L290 TraceCheckUtils]: 82: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:48:35,295 INFO L290 TraceCheckUtils]: 83: Hoare triple {77274#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {77275#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 08:48:35,295 INFO L290 TraceCheckUtils]: 84: Hoare triple {77275#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {77270#false} is VALID [2022-04-08 08:48:35,295 INFO L290 TraceCheckUtils]: 85: Hoare triple {77270#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {77270#false} is VALID [2022-04-08 08:48:35,296 INFO L290 TraceCheckUtils]: 86: Hoare triple {77270#false} assume !(9 == ~blastFlag~0); {77270#false} is VALID [2022-04-08 08:48:35,296 INFO L290 TraceCheckUtils]: 87: Hoare triple {77270#false} assume 12 == ~blastFlag~0; {77270#false} is VALID [2022-04-08 08:48:35,296 INFO L290 TraceCheckUtils]: 88: Hoare triple {77270#false} assume !false; {77270#false} is VALID [2022-04-08 08:48:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:48:35,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707788568] [2022-04-08 08:48:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707788568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:35,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:35,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258659520] [2022-04-08 08:48:35,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258659520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:35,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:35,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365418274] [2022-04-08 08:48:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:35,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-08 08:48:35,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:35,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:35,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:35,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:35,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:35,353 INFO L87 Difference]: Start difference. First operand 654 states and 987 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:40,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:42,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:46,301 INFO L93 Difference]: Finished difference Result 1597 states and 2410 transitions. [2022-04-08 08:48:46,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:46,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-08 08:48:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-08 08:48:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-08 08:48:46,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-08 08:48:46,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:46,759 INFO L225 Difference]: With dead ends: 1597 [2022-04-08 08:48:46,759 INFO L226 Difference]: Without dead ends: 969 [2022-04-08 08:48:46,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:48:46,761 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 126 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:48:46,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 382 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 489 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-04-08 08:48:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-08 08:48:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 720. [2022-04-08 08:48:46,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:46,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 720 states, 715 states have (on average 1.5552447552447553) internal successors, (1112), 715 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:46,808 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 720 states, 715 states have (on average 1.5552447552447553) internal successors, (1112), 715 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:46,809 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 720 states, 715 states have (on average 1.5552447552447553) internal successors, (1112), 715 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:46,834 INFO L93 Difference]: Finished difference Result 969 states and 1451 transitions. [2022-04-08 08:48:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1451 transitions. [2022-04-08 08:48:46,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:46,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:46,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 720 states, 715 states have (on average 1.5552447552447553) internal successors, (1112), 715 states have internal predecessors, (1112), 3 states have call successors, (3), 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 969 states. [2022-04-08 08:48:46,836 INFO L87 Difference]: Start difference. First operand has 720 states, 715 states have (on average 1.5552447552447553) internal successors, (1112), 715 states have internal predecessors, (1112), 3 states have call successors, (3), 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 969 states. [2022-04-08 08:48:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:46,860 INFO L93 Difference]: Finished difference Result 969 states and 1451 transitions. [2022-04-08 08:48:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1451 transitions. [2022-04-08 08:48:46,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:46,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:46,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:46,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 715 states have (on average 1.5552447552447553) internal successors, (1112), 715 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1116 transitions. [2022-04-08 08:48:46,880 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1116 transitions. Word has length 89 [2022-04-08 08:48:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:46,880 INFO L478 AbstractCegarLoop]: Abstraction has 720 states and 1116 transitions. [2022-04-08 08:48:46,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:46,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 720 states and 1116 transitions. [2022-04-08 08:48:50,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1116 edges. 1115 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1116 transitions. [2022-04-08 08:48:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 08:48:50,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:50,060 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:48:50,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:48:50,060 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:50,061 INFO L85 PathProgramCache]: Analyzing trace with hash -537282117, now seen corresponding path program 1 times [2022-04-08 08:48:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:50,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933488148] [2022-04-08 08:48:50,112 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:48:50,113 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:48:50,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash -537282117, now seen corresponding path program 2 times [2022-04-08 08:48:50,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:50,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773774165] [2022-04-08 08:48:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:50,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:50,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:50,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {83860#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {83853#true} is VALID [2022-04-08 08:48:50,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {83853#true} assume true; {83853#true} is VALID [2022-04-08 08:48:50,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83853#true} {83853#true} #710#return; {83853#true} is VALID [2022-04-08 08:48:50,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {83853#true} call ULTIMATE.init(); {83860#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:48:50,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {83860#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {83853#true} is VALID [2022-04-08 08:48:50,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {83853#true} assume true; {83853#true} is VALID [2022-04-08 08:48:50,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83853#true} {83853#true} #710#return; {83853#true} is VALID [2022-04-08 08:48:50,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {83853#true} call #t~ret161 := main(); {83853#true} is VALID [2022-04-08 08:48:50,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {83853#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {83853#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L272 TraceCheckUtils]: 7: Hoare triple {83853#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {83853#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {83853#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {83853#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {83853#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {83853#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {83853#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {83853#true} assume !false; {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {83853#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {83853#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {83853#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {83853#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {83853#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {83853#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {83853#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {83853#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {83853#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {83853#true} assume 8464 == #t~mem55;havoc #t~mem55; {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {83853#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {83853#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {83853#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {83853#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {83853#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {83853#true} ~skip~0 := 0; {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {83853#true} assume !false; {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {83853#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {83853#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {83853#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {83853#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {83853#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {83853#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {83853#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {83853#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {83853#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {83853#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {83853#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {83853#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {83853#true} assume 8496 == #t~mem58;havoc #t~mem58; {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {83853#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {83853#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {83853#true} is VALID [2022-04-08 08:48:50,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {83853#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {83853#true} is VALID [2022-04-08 08:48:50,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {83853#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,286 INFO L290 TraceCheckUtils]: 55: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,290 INFO L290 TraceCheckUtils]: 65: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,290 INFO L290 TraceCheckUtils]: 66: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,291 INFO L290 TraceCheckUtils]: 68: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,291 INFO L290 TraceCheckUtils]: 69: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,291 INFO L290 TraceCheckUtils]: 70: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,292 INFO L290 TraceCheckUtils]: 71: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,292 INFO L290 TraceCheckUtils]: 72: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,292 INFO L290 TraceCheckUtils]: 73: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:48:50,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {83858#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {83859#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-08 08:48:50,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {83859#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {83854#false} is VALID [2022-04-08 08:48:50,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {83854#false} assume !(~num1~0 > 0); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 78: Hoare triple {83854#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 79: Hoare triple {83854#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 80: Hoare triple {83854#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 81: Hoare triple {83854#false} ~skip~0 := 0; {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 82: Hoare triple {83854#false} assume !false; {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 83: Hoare triple {83854#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 84: Hoare triple {83854#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 85: Hoare triple {83854#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 86: Hoare triple {83854#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 87: Hoare triple {83854#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 88: Hoare triple {83854#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 89: Hoare triple {83854#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 90: Hoare triple {83854#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 91: Hoare triple {83854#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,294 INFO L290 TraceCheckUtils]: 92: Hoare triple {83854#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 93: Hoare triple {83854#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {83854#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 95: Hoare triple {83854#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 96: Hoare triple {83854#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 97: Hoare triple {83854#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 98: Hoare triple {83854#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 99: Hoare triple {83854#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 100: Hoare triple {83854#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 101: Hoare triple {83854#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 102: Hoare triple {83854#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 103: Hoare triple {83854#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 104: Hoare triple {83854#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 105: Hoare triple {83854#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,295 INFO L290 TraceCheckUtils]: 106: Hoare triple {83854#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 107: Hoare triple {83854#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 108: Hoare triple {83854#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 109: Hoare triple {83854#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 110: Hoare triple {83854#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 111: Hoare triple {83854#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 112: Hoare triple {83854#false} assume 8640 == #t~mem75;havoc #t~mem75; {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 113: Hoare triple {83854#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 114: Hoare triple {83854#false} assume !(9 == ~blastFlag~0); {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 115: Hoare triple {83854#false} assume 12 == ~blastFlag~0; {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L290 TraceCheckUtils]: 116: Hoare triple {83854#false} assume !false; {83854#false} is VALID [2022-04-08 08:48:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:48:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:50,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773774165] [2022-04-08 08:48:50,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773774165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:50,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:50,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:50,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:50,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933488148] [2022-04-08 08:48:50,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933488148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:50,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:50,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120337477] [2022-04-08 08:48:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 117 [2022-04-08 08:48:50,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:50,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:50,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:48:50,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:50,389 INFO L87 Difference]: Start difference. First operand 720 states and 1116 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:48:54,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:56,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:48:58,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:03,516 INFO L93 Difference]: Finished difference Result 1721 states and 2648 transitions. [2022-04-08 08:49:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 117 [2022-04-08 08:49:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 08:49:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-08 08:49:03,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-08 08:49:03,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:03,944 INFO L225 Difference]: With dead ends: 1721 [2022-04-08 08:49:03,944 INFO L226 Difference]: Without dead ends: 1027 [2022-04-08 08:49:03,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:03,946 INFO L913 BasicCegarLoop]: 284 mSDtfsCounter, 93 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:03,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 687 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 633 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-04-08 08:49:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-04-08 08:49:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 822. [2022-04-08 08:49:03,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:03,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1027 states. Second operand has 822 states, 817 states have (on average 1.5630354957160342) internal successors, (1277), 817 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,985 INFO L74 IsIncluded]: Start isIncluded. First operand 1027 states. Second operand has 822 states, 817 states have (on average 1.5630354957160342) internal successors, (1277), 817 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:03,985 INFO L87 Difference]: Start difference. First operand 1027 states. Second operand has 822 states, 817 states have (on average 1.5630354957160342) internal successors, (1277), 817 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:04,012 INFO L93 Difference]: Finished difference Result 1027 states and 1560 transitions. [2022-04-08 08:49:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1560 transitions. [2022-04-08 08:49:04,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:04,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:04,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 822 states, 817 states have (on average 1.5630354957160342) internal successors, (1277), 817 states have internal predecessors, (1277), 3 states have call successors, (3), 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 1027 states. [2022-04-08 08:49:04,014 INFO L87 Difference]: Start difference. First operand has 822 states, 817 states have (on average 1.5630354957160342) internal successors, (1277), 817 states have internal predecessors, (1277), 3 states have call successors, (3), 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 1027 states. [2022-04-08 08:49:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:04,041 INFO L93 Difference]: Finished difference Result 1027 states and 1560 transitions. [2022-04-08 08:49:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1560 transitions. [2022-04-08 08:49:04,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:04,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:04,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:04,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 817 states have (on average 1.5630354957160342) internal successors, (1277), 817 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1281 transitions. [2022-04-08 08:49:04,091 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1281 transitions. Word has length 117 [2022-04-08 08:49:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:04,091 INFO L478 AbstractCegarLoop]: Abstraction has 822 states and 1281 transitions. [2022-04-08 08:49:04,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:04,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 822 states and 1281 transitions. [2022-04-08 08:49:07,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1281 edges. 1280 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1281 transitions. [2022-04-08 08:49:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 08:49:07,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:07,450 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:07,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:49:07,450 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:07,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1029908291, now seen corresponding path program 1 times [2022-04-08 08:49:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:07,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054186988] [2022-04-08 08:49:07,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:07,502 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:07,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1029908291, now seen corresponding path program 2 times [2022-04-08 08:49:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:07,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558270258] [2022-04-08 08:49:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:07,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {91012#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {91005#true} is VALID [2022-04-08 08:49:07,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {91005#true} assume true; {91005#true} is VALID [2022-04-08 08:49:07,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91005#true} {91005#true} #710#return; {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {91005#true} call ULTIMATE.init(); {91012#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:07,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {91012#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {91005#true} assume true; {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91005#true} {91005#true} #710#return; {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {91005#true} call #t~ret161 := main(); {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {91005#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {91005#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L272 TraceCheckUtils]: 7: Hoare triple {91005#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {91005#true} is VALID [2022-04-08 08:49:07,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {91005#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {91005#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {91005#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {91005#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {91005#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {91005#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {91005#true} assume !false; {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {91005#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {91005#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {91005#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {91005#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {91005#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {91005#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {91005#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {91005#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {91005#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {91005#true} assume 8464 == #t~mem55;havoc #t~mem55; {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {91005#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {91005#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {91005#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {91005#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {91005#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {91005#true} ~skip~0 := 0; {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {91005#true} assume !false; {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {91005#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {91005#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {91005#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {91005#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {91005#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {91005#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {91005#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {91005#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {91005#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {91005#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {91005#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {91005#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {91005#true} assume 8496 == #t~mem58;havoc #t~mem58; {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {91005#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {91005#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {91005#true} is VALID [2022-04-08 08:49:07,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {91005#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {91005#true} is VALID [2022-04-08 08:49:07,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {91005#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,663 INFO L290 TraceCheckUtils]: 56: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,665 INFO L290 TraceCheckUtils]: 61: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,666 INFO L290 TraceCheckUtils]: 64: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,667 INFO L290 TraceCheckUtils]: 66: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,667 INFO L290 TraceCheckUtils]: 67: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,667 INFO L290 TraceCheckUtils]: 68: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,668 INFO L290 TraceCheckUtils]: 69: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,668 INFO L290 TraceCheckUtils]: 70: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,668 INFO L290 TraceCheckUtils]: 71: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,669 INFO L290 TraceCheckUtils]: 72: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,669 INFO L290 TraceCheckUtils]: 74: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:07,670 INFO L290 TraceCheckUtils]: 75: Hoare triple {91010#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {91011#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 08:49:07,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {91011#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {91006#false} is VALID [2022-04-08 08:49:07,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {91006#false} assume !(~num1~0 > 0); {91006#false} is VALID [2022-04-08 08:49:07,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {91006#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {91006#false} is VALID [2022-04-08 08:49:07,670 INFO L290 TraceCheckUtils]: 79: Hoare triple {91006#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,670 INFO L290 TraceCheckUtils]: 80: Hoare triple {91006#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {91006#false} is VALID [2022-04-08 08:49:07,670 INFO L290 TraceCheckUtils]: 81: Hoare triple {91006#false} ~skip~0 := 0; {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {91006#false} assume !false; {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 83: Hoare triple {91006#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 84: Hoare triple {91006#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 85: Hoare triple {91006#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 86: Hoare triple {91006#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 87: Hoare triple {91006#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 88: Hoare triple {91006#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 89: Hoare triple {91006#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 90: Hoare triple {91006#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 91: Hoare triple {91006#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 92: Hoare triple {91006#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 93: Hoare triple {91006#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 94: Hoare triple {91006#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 95: Hoare triple {91006#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,671 INFO L290 TraceCheckUtils]: 96: Hoare triple {91006#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 97: Hoare triple {91006#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 98: Hoare triple {91006#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 99: Hoare triple {91006#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 100: Hoare triple {91006#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 101: Hoare triple {91006#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 102: Hoare triple {91006#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 103: Hoare triple {91006#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 104: Hoare triple {91006#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 105: Hoare triple {91006#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 106: Hoare triple {91006#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 107: Hoare triple {91006#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 108: Hoare triple {91006#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 109: Hoare triple {91006#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,672 INFO L290 TraceCheckUtils]: 110: Hoare triple {91006#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,673 INFO L290 TraceCheckUtils]: 111: Hoare triple {91006#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {91006#false} is VALID [2022-04-08 08:49:07,673 INFO L290 TraceCheckUtils]: 112: Hoare triple {91006#false} assume 8640 == #t~mem75;havoc #t~mem75; {91006#false} is VALID [2022-04-08 08:49:07,673 INFO L290 TraceCheckUtils]: 113: Hoare triple {91006#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {91006#false} is VALID [2022-04-08 08:49:07,673 INFO L290 TraceCheckUtils]: 114: Hoare triple {91006#false} assume !(9 == ~blastFlag~0); {91006#false} is VALID [2022-04-08 08:49:07,673 INFO L290 TraceCheckUtils]: 115: Hoare triple {91006#false} assume 12 == ~blastFlag~0; {91006#false} is VALID [2022-04-08 08:49:07,673 INFO L290 TraceCheckUtils]: 116: Hoare triple {91006#false} assume !false; {91006#false} is VALID [2022-04-08 08:49:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:49:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:07,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558270258] [2022-04-08 08:49:07,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558270258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:07,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:07,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:07,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:07,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054186988] [2022-04-08 08:49:07,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054186988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:07,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:07,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653335126] [2022-04-08 08:49:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:07,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 117 [2022-04-08 08:49:07,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:07,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:07,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:07,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:07,747 INFO L87 Difference]: Start difference. First operand 822 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:12,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:22,134 INFO L93 Difference]: Finished difference Result 2095 states and 3262 transitions. [2022-04-08 08:49:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 117 [2022-04-08 08:49:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-08 08:49:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-08 08:49:22,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 605 transitions. [2022-04-08 08:49:22,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:22,615 INFO L225 Difference]: With dead ends: 2095 [2022-04-08 08:49:22,615 INFO L226 Difference]: Without dead ends: 1299 [2022-04-08 08:49:22,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:22,617 INFO L913 BasicCegarLoop]: 283 mSDtfsCounter, 132 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:22,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 678 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 08:49:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2022-04-08 08:49:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 912. [2022-04-08 08:49:22,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:22,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1299 states. Second operand has 912 states, 907 states have (on average 1.5766262403528115) internal successors, (1430), 907 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:22,666 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand has 912 states, 907 states have (on average 1.5766262403528115) internal successors, (1430), 907 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:22,666 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand has 912 states, 907 states have (on average 1.5766262403528115) internal successors, (1430), 907 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:22,706 INFO L93 Difference]: Finished difference Result 1299 states and 2006 transitions. [2022-04-08 08:49:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 2006 transitions. [2022-04-08 08:49:22,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:22,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:22,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 907 states have (on average 1.5766262403528115) internal successors, (1430), 907 states have internal predecessors, (1430), 3 states have call successors, (3), 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 1299 states. [2022-04-08 08:49:22,708 INFO L87 Difference]: Start difference. First operand has 912 states, 907 states have (on average 1.5766262403528115) internal successors, (1430), 907 states have internal predecessors, (1430), 3 states have call successors, (3), 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 1299 states. [2022-04-08 08:49:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:22,748 INFO L93 Difference]: Finished difference Result 1299 states and 2006 transitions. [2022-04-08 08:49:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 2006 transitions. [2022-04-08 08:49:22,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:22,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:22,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:22,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 907 states have (on average 1.5766262403528115) internal successors, (1430), 907 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1434 transitions. [2022-04-08 08:49:22,780 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1434 transitions. Word has length 117 [2022-04-08 08:49:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:22,780 INFO L478 AbstractCegarLoop]: Abstraction has 912 states and 1434 transitions. [2022-04-08 08:49:22,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:22,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1434 transitions. [2022-04-08 08:49:26,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1434 edges. 1433 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1434 transitions. [2022-04-08 08:49:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 08:49:26,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:26,259 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:26,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:49:26,259 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:26,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash -158828971, now seen corresponding path program 1 times [2022-04-08 08:49:26,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:26,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [853753540] [2022-04-08 08:49:26,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:26,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:26,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:26,355 INFO L85 PathProgramCache]: Analyzing trace with hash -158828971, now seen corresponding path program 2 times [2022-04-08 08:49:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:26,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88147424] [2022-04-08 08:49:26,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:26,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:26,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {99636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {99629#true} is VALID [2022-04-08 08:49:26,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {99629#true} assume true; {99629#true} is VALID [2022-04-08 08:49:26,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99629#true} {99629#true} #710#return; {99629#true} is VALID [2022-04-08 08:49:26,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {99629#true} call ULTIMATE.init(); {99636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:26,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {99636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {99629#true} is VALID [2022-04-08 08:49:26,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {99629#true} assume true; {99629#true} is VALID [2022-04-08 08:49:26,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99629#true} {99629#true} #710#return; {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {99629#true} call #t~ret161 := main(); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {99629#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {99629#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L272 TraceCheckUtils]: 7: Hoare triple {99629#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {99629#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {99629#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {99629#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {99629#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {99629#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {99629#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {99629#true} assume !false; {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {99629#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {99629#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {99629#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {99629#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {99629#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {99629#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {99629#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {99629#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {99629#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {99629#true} assume 8464 == #t~mem55;havoc #t~mem55; {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {99629#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {99629#true} is VALID [2022-04-08 08:49:26,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {99629#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {99629#true} is VALID [2022-04-08 08:49:26,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {99629#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:26,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:26,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:26,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:26,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:26,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {99634#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99635#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 08:49:26,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {99635#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {99630#false} is VALID [2022-04-08 08:49:26,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {99630#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {99630#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {99630#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {99630#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {99630#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {99630#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {99630#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {99630#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {99630#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {99630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {99630#false} ~skip~0 := 0; {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {99630#false} assume !false; {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {99630#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {99630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {99630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {99630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {99630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {99630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {99630#false} assume 8480 == #t~mem52;havoc #t~mem52; {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {99630#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {99630#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {99630#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {99630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {99630#false} ~skip~0 := 0; {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {99630#false} assume !false; {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {99630#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {99630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {99630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {99630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {99630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,515 INFO L290 TraceCheckUtils]: 64: Hoare triple {99630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {99630#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {99630#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {99630#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {99630#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {99630#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {99630#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {99630#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {99630#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {99630#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {99630#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {99630#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {99630#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {99630#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 78: Hoare triple {99630#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 79: Hoare triple {99630#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 80: Hoare triple {99630#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 81: Hoare triple {99630#false} assume 8448 == #t~mem68;havoc #t~mem68; {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 82: Hoare triple {99630#false} assume !(~num1~0 > 0); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {99630#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {99630#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {99630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {99630#false} ~skip~0 := 0; {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {99630#false} assume !false; {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {99630#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {99630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 90: Hoare triple {99630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,517 INFO L290 TraceCheckUtils]: 91: Hoare triple {99630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {99630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {99630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {99630#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 95: Hoare triple {99630#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 96: Hoare triple {99630#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {99630#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 98: Hoare triple {99630#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 99: Hoare triple {99630#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 100: Hoare triple {99630#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 101: Hoare triple {99630#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 102: Hoare triple {99630#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 103: Hoare triple {99630#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 104: Hoare triple {99630#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,518 INFO L290 TraceCheckUtils]: 105: Hoare triple {99630#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 106: Hoare triple {99630#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 107: Hoare triple {99630#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 108: Hoare triple {99630#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 109: Hoare triple {99630#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 110: Hoare triple {99630#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 111: Hoare triple {99630#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 112: Hoare triple {99630#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 113: Hoare triple {99630#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 114: Hoare triple {99630#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 115: Hoare triple {99630#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 116: Hoare triple {99630#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 117: Hoare triple {99630#false} assume 8640 == #t~mem75;havoc #t~mem75; {99630#false} is VALID [2022-04-08 08:49:26,519 INFO L290 TraceCheckUtils]: 118: Hoare triple {99630#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {99630#false} is VALID [2022-04-08 08:49:26,520 INFO L290 TraceCheckUtils]: 119: Hoare triple {99630#false} assume !(9 == ~blastFlag~0); {99630#false} is VALID [2022-04-08 08:49:26,520 INFO L290 TraceCheckUtils]: 120: Hoare triple {99630#false} assume 12 == ~blastFlag~0; {99630#false} is VALID [2022-04-08 08:49:26,520 INFO L290 TraceCheckUtils]: 121: Hoare triple {99630#false} assume !false; {99630#false} is VALID [2022-04-08 08:49:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-08 08:49:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:26,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88147424] [2022-04-08 08:49:26,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88147424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:26,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:26,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:26,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [853753540] [2022-04-08 08:49:26,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [853753540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:26,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:26,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193580879] [2022-04-08 08:49:26,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:26,521 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 122 [2022-04-08 08:49:26,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:26,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:26,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:26,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:26,584 INFO L87 Difference]: Start difference. First operand 912 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:29,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:31,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:33,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:36,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:40,514 INFO L93 Difference]: Finished difference Result 1765 states and 2728 transitions. [2022-04-08 08:49:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:40,514 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 122 [2022-04-08 08:49:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:49:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-08 08:49:40,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-08 08:49:40,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:40,990 INFO L225 Difference]: With dead ends: 1765 [2022-04-08 08:49:40,990 INFO L226 Difference]: Without dead ends: 1141 [2022-04-08 08:49:40,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:40,994 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 154 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:40,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 378 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 484 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2022-04-08 08:49:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-04-08 08:49:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 912. [2022-04-08 08:49:41,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:41,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1141 states. Second operand has 912 states, 907 states have (on average 1.5600882028665932) internal successors, (1415), 907 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:41,044 INFO L74 IsIncluded]: Start isIncluded. First operand 1141 states. Second operand has 912 states, 907 states have (on average 1.5600882028665932) internal successors, (1415), 907 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:41,045 INFO L87 Difference]: Start difference. First operand 1141 states. Second operand has 912 states, 907 states have (on average 1.5600882028665932) internal successors, (1415), 907 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:41,107 INFO L93 Difference]: Finished difference Result 1141 states and 1730 transitions. [2022-04-08 08:49:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1730 transitions. [2022-04-08 08:49:41,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:41,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:41,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 907 states have (on average 1.5600882028665932) internal successors, (1415), 907 states have internal predecessors, (1415), 3 states have call successors, (3), 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 1141 states. [2022-04-08 08:49:41,110 INFO L87 Difference]: Start difference. First operand has 912 states, 907 states have (on average 1.5600882028665932) internal successors, (1415), 907 states have internal predecessors, (1415), 3 states have call successors, (3), 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 1141 states. [2022-04-08 08:49:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:41,142 INFO L93 Difference]: Finished difference Result 1141 states and 1730 transitions. [2022-04-08 08:49:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1730 transitions. [2022-04-08 08:49:41,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:41,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:41,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:41,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 907 states have (on average 1.5600882028665932) internal successors, (1415), 907 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1419 transitions. [2022-04-08 08:49:41,196 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1419 transitions. Word has length 122 [2022-04-08 08:49:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:41,196 INFO L478 AbstractCegarLoop]: Abstraction has 912 states and 1419 transitions. [2022-04-08 08:49:41,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:41,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1419 transitions. [2022-04-08 08:49:44,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1419 edges. 1418 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1419 transitions. [2022-04-08 08:49:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 08:49:44,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:44,787 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:44,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:49:44,787 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1699899791, now seen corresponding path program 1 times [2022-04-08 08:49:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:44,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [333409695] [2022-04-08 08:49:44,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:49:44,865 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:49:44,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1699899791, now seen corresponding path program 2 times [2022-04-08 08:49:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:44,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340938773] [2022-04-08 08:49:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:45,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {107284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {107277#true} is VALID [2022-04-08 08:49:45,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {107277#true} assume true; {107277#true} is VALID [2022-04-08 08:49:45,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107277#true} {107277#true} #710#return; {107277#true} is VALID [2022-04-08 08:49:45,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {107277#true} call ULTIMATE.init(); {107284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:49:45,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {107284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {107277#true} is VALID [2022-04-08 08:49:45,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {107277#true} assume true; {107277#true} is VALID [2022-04-08 08:49:45,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107277#true} {107277#true} #710#return; {107277#true} is VALID [2022-04-08 08:49:45,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {107277#true} call #t~ret161 := main(); {107277#true} is VALID [2022-04-08 08:49:45,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {107277#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {107277#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L272 TraceCheckUtils]: 7: Hoare triple {107277#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {107277#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {107277#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {107277#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {107277#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {107277#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {107277#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {107277#true} assume !false; {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {107277#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {107277#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {107277#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {107277#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {107277#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {107277#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {107277#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {107277#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {107277#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {107277#true} assume 8464 == #t~mem55;havoc #t~mem55; {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {107277#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {107277#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {107277#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {107277#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {107277#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {107277#true} ~skip~0 := 0; {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {107277#true} assume !false; {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {107277#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {107277#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {107277#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {107277#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {107277#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {107277#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {107277#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {107277#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {107277#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {107277#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {107277#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {107277#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {107277#true} assume 8496 == #t~mem58;havoc #t~mem58; {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {107277#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {107277#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107277#true} is VALID [2022-04-08 08:49:45,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {107277#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {107277#true} is VALID [2022-04-08 08:49:45,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {107277#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,138 INFO L290 TraceCheckUtils]: 74: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,138 INFO L290 TraceCheckUtils]: 76: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:49:45,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {107282#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {107283#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 08:49:45,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {107283#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {107278#false} is VALID [2022-04-08 08:49:45,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {107278#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {107278#false} is VALID [2022-04-08 08:49:45,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {107278#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {107278#false} is VALID [2022-04-08 08:49:45,140 INFO L290 TraceCheckUtils]: 84: Hoare triple {107278#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {107278#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {107278#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {107278#false} ~skip~0 := 0; {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {107278#false} assume !false; {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {107278#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {107278#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 91: Hoare triple {107278#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 92: Hoare triple {107278#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 93: Hoare triple {107278#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 94: Hoare triple {107278#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 95: Hoare triple {107278#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 96: Hoare triple {107278#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 97: Hoare triple {107278#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 98: Hoare triple {107278#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 99: Hoare triple {107278#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,141 INFO L290 TraceCheckUtils]: 100: Hoare triple {107278#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 101: Hoare triple {107278#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 102: Hoare triple {107278#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 103: Hoare triple {107278#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 104: Hoare triple {107278#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 105: Hoare triple {107278#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 106: Hoare triple {107278#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 107: Hoare triple {107278#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 108: Hoare triple {107278#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 109: Hoare triple {107278#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 110: Hoare triple {107278#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 111: Hoare triple {107278#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 112: Hoare triple {107278#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 113: Hoare triple {107278#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 114: Hoare triple {107278#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,142 INFO L290 TraceCheckUtils]: 115: Hoare triple {107278#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L290 TraceCheckUtils]: 116: Hoare triple {107278#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L290 TraceCheckUtils]: 117: Hoare triple {107278#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L290 TraceCheckUtils]: 118: Hoare triple {107278#false} assume 8640 == #t~mem75;havoc #t~mem75; {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L290 TraceCheckUtils]: 119: Hoare triple {107278#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L290 TraceCheckUtils]: 120: Hoare triple {107278#false} assume !(9 == ~blastFlag~0); {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L290 TraceCheckUtils]: 121: Hoare triple {107278#false} assume 12 == ~blastFlag~0; {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L290 TraceCheckUtils]: 122: Hoare triple {107278#false} assume !false; {107278#false} is VALID [2022-04-08 08:49:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:49:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:45,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340938773] [2022-04-08 08:49:45,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340938773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:45,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:45,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:45,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:45,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [333409695] [2022-04-08 08:49:45,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [333409695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:45,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:45,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394026384] [2022-04-08 08:49:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 08:49:45,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:45,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:45,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:45,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:45,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:45,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:45,218 INFO L87 Difference]: Start difference. First operand 912 states and 1419 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:48,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:53,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:49:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:57,219 INFO L93 Difference]: Finished difference Result 2147 states and 3316 transitions. [2022-04-08 08:49:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 08:49:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:49:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:49:57,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-08 08:49:57,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:57,693 INFO L225 Difference]: With dead ends: 2147 [2022-04-08 08:49:57,693 INFO L226 Difference]: Without dead ends: 1261 [2022-04-08 08:49:57,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:49:57,694 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 127 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:57,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 378 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 485 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-04-08 08:49:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-04-08 08:49:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1023. [2022-04-08 08:49:57,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:57,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1261 states. Second operand has 1023 states, 1018 states have (on average 1.5667976424361494) internal successors, (1595), 1018 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:57,755 INFO L74 IsIncluded]: Start isIncluded. First operand 1261 states. Second operand has 1023 states, 1018 states have (on average 1.5667976424361494) internal successors, (1595), 1018 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:57,755 INFO L87 Difference]: Start difference. First operand 1261 states. Second operand has 1023 states, 1018 states have (on average 1.5667976424361494) internal successors, (1595), 1018 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:57,793 INFO L93 Difference]: Finished difference Result 1261 states and 1922 transitions. [2022-04-08 08:49:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1922 transitions. [2022-04-08 08:49:57,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:57,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:57,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1018 states have (on average 1.5667976424361494) internal successors, (1595), 1018 states have internal predecessors, (1595), 3 states have call successors, (3), 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 1261 states. [2022-04-08 08:49:57,795 INFO L87 Difference]: Start difference. First operand has 1023 states, 1018 states have (on average 1.5667976424361494) internal successors, (1595), 1018 states have internal predecessors, (1595), 3 states have call successors, (3), 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 1261 states. [2022-04-08 08:49:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:57,833 INFO L93 Difference]: Finished difference Result 1261 states and 1922 transitions. [2022-04-08 08:49:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1922 transitions. [2022-04-08 08:49:57,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:57,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:57,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:57,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.5667976424361494) internal successors, (1595), 1018 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1599 transitions. [2022-04-08 08:49:57,886 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1599 transitions. Word has length 123 [2022-04-08 08:49:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:57,886 INFO L478 AbstractCegarLoop]: Abstraction has 1023 states and 1599 transitions. [2022-04-08 08:49:57,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:49:57,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1599 transitions. [2022-04-08 08:50:01,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1599 edges. 1598 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1599 transitions. [2022-04-08 08:50:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-08 08:50:01,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:01,698 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:01,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:50:01,698 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 287066353, now seen corresponding path program 1 times [2022-04-08 08:50:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:01,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823007088] [2022-04-08 08:50:01,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:01,759 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:01,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash 287066353, now seen corresponding path program 2 times [2022-04-08 08:50:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:01,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965784432] [2022-04-08 08:50:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:01,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {116158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {116151#true} is VALID [2022-04-08 08:50:01,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {116151#true} assume true; {116151#true} is VALID [2022-04-08 08:50:01,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116151#true} {116151#true} #710#return; {116151#true} is VALID [2022-04-08 08:50:01,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {116151#true} call ULTIMATE.init(); {116158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:01,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {116158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {116151#true} is VALID [2022-04-08 08:50:01,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {116151#true} assume true; {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116151#true} {116151#true} #710#return; {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {116151#true} call #t~ret161 := main(); {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {116151#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {116151#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L272 TraceCheckUtils]: 7: Hoare triple {116151#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {116151#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {116151#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {116151#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {116151#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {116151#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {116151#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {116151#true} assume !false; {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {116151#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {116151#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {116151#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {116151#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {116151#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {116151#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {116151#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {116151#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {116151#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {116151#true} assume 8464 == #t~mem55;havoc #t~mem55; {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {116151#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {116151#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {116151#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {116151#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {116151#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {116151#true} ~skip~0 := 0; {116151#true} is VALID [2022-04-08 08:50:01,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {116151#true} assume !false; {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {116151#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {116151#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {116151#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {116151#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {116151#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {116151#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {116151#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {116151#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {116151#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {116151#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {116151#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {116151#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {116151#true} assume 8496 == #t~mem58;havoc #t~mem58; {116151#true} is VALID [2022-04-08 08:50:01,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {116151#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {116151#true} is VALID [2022-04-08 08:50:01,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {116151#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116151#true} is VALID [2022-04-08 08:50:01,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {116151#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {116151#true} is VALID [2022-04-08 08:50:01,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {116151#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,929 INFO L290 TraceCheckUtils]: 53: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,930 INFO L290 TraceCheckUtils]: 55: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,932 INFO L290 TraceCheckUtils]: 59: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,933 INFO L290 TraceCheckUtils]: 63: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,933 INFO L290 TraceCheckUtils]: 64: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,935 INFO L290 TraceCheckUtils]: 68: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,935 INFO L290 TraceCheckUtils]: 69: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,937 INFO L290 TraceCheckUtils]: 74: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,937 INFO L290 TraceCheckUtils]: 75: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,938 INFO L290 TraceCheckUtils]: 76: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-08 08:50:01,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {116156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {116157#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 82: Hoare triple {116157#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 83: Hoare triple {116152#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {116152#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {116152#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {116152#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 87: Hoare triple {116152#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {116152#false} ~skip~0 := 0; {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {116152#false} assume !false; {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {116152#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {116152#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,940 INFO L290 TraceCheckUtils]: 92: Hoare triple {116152#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 93: Hoare triple {116152#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 94: Hoare triple {116152#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 95: Hoare triple {116152#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 96: Hoare triple {116152#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 97: Hoare triple {116152#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 98: Hoare triple {116152#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 99: Hoare triple {116152#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 100: Hoare triple {116152#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 101: Hoare triple {116152#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 102: Hoare triple {116152#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 103: Hoare triple {116152#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 104: Hoare triple {116152#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 105: Hoare triple {116152#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 106: Hoare triple {116152#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,941 INFO L290 TraceCheckUtils]: 107: Hoare triple {116152#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 108: Hoare triple {116152#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 109: Hoare triple {116152#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 110: Hoare triple {116152#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 111: Hoare triple {116152#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 112: Hoare triple {116152#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 113: Hoare triple {116152#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 114: Hoare triple {116152#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 115: Hoare triple {116152#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 116: Hoare triple {116152#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 117: Hoare triple {116152#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 118: Hoare triple {116152#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 119: Hoare triple {116152#false} assume 8640 == #t~mem75;havoc #t~mem75; {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 120: Hoare triple {116152#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 121: Hoare triple {116152#false} assume !(9 == ~blastFlag~0); {116152#false} is VALID [2022-04-08 08:50:01,942 INFO L290 TraceCheckUtils]: 122: Hoare triple {116152#false} assume 12 == ~blastFlag~0; {116152#false} is VALID [2022-04-08 08:50:01,943 INFO L290 TraceCheckUtils]: 123: Hoare triple {116152#false} assume !false; {116152#false} is VALID [2022-04-08 08:50:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:50:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:01,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965784432] [2022-04-08 08:50:01,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965784432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:01,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:01,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:01,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:01,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823007088] [2022-04-08 08:50:01,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823007088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:01,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:01,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415282339] [2022-04-08 08:50:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-08 08:50:01,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:01,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:02,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:02,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:02,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:02,021 INFO L87 Difference]: Start difference. First operand 1023 states and 1599 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:04,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:06,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:09,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:13,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:17,009 INFO L93 Difference]: Finished difference Result 2249 states and 3478 transitions. [2022-04-08 08:50:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-08 08:50:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:50:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-08 08:50:17,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-08 08:50:17,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:17,478 INFO L225 Difference]: With dead ends: 2249 [2022-04-08 08:50:17,478 INFO L226 Difference]: Without dead ends: 1252 [2022-04-08 08:50:17,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:50:17,479 INFO L913 BasicCegarLoop]: 139 mSDtfsCounter, 126 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:17,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 392 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-04-08 08:50:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-04-08 08:50:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1023. [2022-04-08 08:50:17,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:17,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1252 states. Second operand has 1023 states, 1018 states have (on average 1.5609037328094302) internal successors, (1589), 1018 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:17,552 INFO L74 IsIncluded]: Start isIncluded. First operand 1252 states. Second operand has 1023 states, 1018 states have (on average 1.5609037328094302) internal successors, (1589), 1018 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:17,552 INFO L87 Difference]: Start difference. First operand 1252 states. Second operand has 1023 states, 1018 states have (on average 1.5609037328094302) internal successors, (1589), 1018 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:17,590 INFO L93 Difference]: Finished difference Result 1252 states and 1904 transitions. [2022-04-08 08:50:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1904 transitions. [2022-04-08 08:50:17,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:17,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:17,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1018 states have (on average 1.5609037328094302) internal successors, (1589), 1018 states have internal predecessors, (1589), 3 states have call successors, (3), 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 1252 states. [2022-04-08 08:50:17,592 INFO L87 Difference]: Start difference. First operand has 1023 states, 1018 states have (on average 1.5609037328094302) internal successors, (1589), 1018 states have internal predecessors, (1589), 3 states have call successors, (3), 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 1252 states. [2022-04-08 08:50:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:17,629 INFO L93 Difference]: Finished difference Result 1252 states and 1904 transitions. [2022-04-08 08:50:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1904 transitions. [2022-04-08 08:50:17,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:17,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:17,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:17,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.5609037328094302) internal successors, (1589), 1018 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1593 transitions. [2022-04-08 08:50:17,668 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1593 transitions. Word has length 124 [2022-04-08 08:50:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:17,669 INFO L478 AbstractCegarLoop]: Abstraction has 1023 states and 1593 transitions. [2022-04-08 08:50:17,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:17,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1593 transitions. [2022-04-08 08:50:21,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1593 edges. 1592 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1593 transitions. [2022-04-08 08:50:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 08:50:21,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:21,558 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:21,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:50:21,558 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:21,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -688048203, now seen corresponding path program 1 times [2022-04-08 08:50:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:21,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416615378] [2022-04-08 08:50:21,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:21,622 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:21,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash -688048203, now seen corresponding path program 2 times [2022-04-08 08:50:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:21,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825422723] [2022-04-08 08:50:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:21,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {125218#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {125211#true} is VALID [2022-04-08 08:50:21,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {125211#true} assume true; {125211#true} is VALID [2022-04-08 08:50:21,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {125211#true} {125211#true} #710#return; {125211#true} is VALID [2022-04-08 08:50:21,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {125211#true} call ULTIMATE.init(); {125218#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {125218#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {125211#true} assume true; {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125211#true} {125211#true} #710#return; {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {125211#true} call #t~ret161 := main(); {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {125211#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {125211#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {125211#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {125211#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {125211#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {125211#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {125211#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {125211#true} is VALID [2022-04-08 08:50:21,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {125211#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {125211#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {125211#true} assume !false; {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {125211#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {125211#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {125211#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {125211#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {125211#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {125211#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {125211#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {125211#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {125211#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {125211#true} assume 8464 == #t~mem55;havoc #t~mem55; {125211#true} is VALID [2022-04-08 08:50:21,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {125211#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {125211#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {125211#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {125211#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {125211#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {125211#true} ~skip~0 := 0; {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {125211#true} assume !false; {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {125211#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {125211#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {125211#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {125211#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {125211#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {125211#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {125211#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {125211#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {125211#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {125211#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {125211#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {125211#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {125211#true} assume 8496 == #t~mem58;havoc #t~mem58; {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {125211#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {125211#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {125211#true} is VALID [2022-04-08 08:50:21,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {125211#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {125211#true} is VALID [2022-04-08 08:50:21,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {125211#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,799 INFO L290 TraceCheckUtils]: 50: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:50:21,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {125216#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125217#(= |ssl3_accept_#t~mem53| 8656)} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {125217#(= |ssl3_accept_#t~mem53| 8656)} assume 8481 == #t~mem53;havoc #t~mem53; {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {125212#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {125212#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {125212#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {125212#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 66: Hoare triple {125212#false} ~skip~0 := 0; {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {125212#false} assume !false; {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 68: Hoare triple {125212#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 69: Hoare triple {125212#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {125212#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,803 INFO L290 TraceCheckUtils]: 71: Hoare triple {125212#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {125212#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {125212#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 74: Hoare triple {125212#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {125212#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {125212#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {125212#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {125212#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 79: Hoare triple {125212#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 80: Hoare triple {125212#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 81: Hoare triple {125212#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 82: Hoare triple {125212#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 83: Hoare triple {125212#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 84: Hoare triple {125212#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 85: Hoare triple {125212#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,804 INFO L290 TraceCheckUtils]: 86: Hoare triple {125212#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 87: Hoare triple {125212#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {125212#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 89: Hoare triple {125212#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 90: Hoare triple {125212#false} assume 8448 == #t~mem68;havoc #t~mem68; {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 91: Hoare triple {125212#false} assume !(~num1~0 > 0); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 92: Hoare triple {125212#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 93: Hoare triple {125212#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 94: Hoare triple {125212#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 95: Hoare triple {125212#false} ~skip~0 := 0; {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 96: Hoare triple {125212#false} assume !false; {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 97: Hoare triple {125212#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 98: Hoare triple {125212#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 99: Hoare triple {125212#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,805 INFO L290 TraceCheckUtils]: 100: Hoare triple {125212#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 101: Hoare triple {125212#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 102: Hoare triple {125212#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 103: Hoare triple {125212#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 104: Hoare triple {125212#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 105: Hoare triple {125212#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 106: Hoare triple {125212#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 107: Hoare triple {125212#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 108: Hoare triple {125212#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 109: Hoare triple {125212#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 110: Hoare triple {125212#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 111: Hoare triple {125212#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 112: Hoare triple {125212#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 113: Hoare triple {125212#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 114: Hoare triple {125212#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,806 INFO L290 TraceCheckUtils]: 115: Hoare triple {125212#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 116: Hoare triple {125212#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 117: Hoare triple {125212#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 118: Hoare triple {125212#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 119: Hoare triple {125212#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 120: Hoare triple {125212#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 121: Hoare triple {125212#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 122: Hoare triple {125212#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 123: Hoare triple {125212#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 124: Hoare triple {125212#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 125: Hoare triple {125212#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 126: Hoare triple {125212#false} assume 8640 == #t~mem75;havoc #t~mem75; {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 127: Hoare triple {125212#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 128: Hoare triple {125212#false} assume !(9 == ~blastFlag~0); {125212#false} is VALID [2022-04-08 08:50:21,807 INFO L290 TraceCheckUtils]: 129: Hoare triple {125212#false} assume 12 == ~blastFlag~0; {125212#false} is VALID [2022-04-08 08:50:21,808 INFO L290 TraceCheckUtils]: 130: Hoare triple {125212#false} assume !false; {125212#false} is VALID [2022-04-08 08:50:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:50:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825422723] [2022-04-08 08:50:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825422723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:21,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:21,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:21,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416615378] [2022-04-08 08:50:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416615378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:21,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:21,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816038521] [2022-04-08 08:50:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 131 [2022-04-08 08:50:21,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:21,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:21,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:21,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:21,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:21,873 INFO L87 Difference]: Start difference. First operand 1023 states and 1593 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:23,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:28,899 INFO L93 Difference]: Finished difference Result 2292 states and 3550 transitions. [2022-04-08 08:50:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:28,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 131 [2022-04-08 08:50:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-08 08:50:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-08 08:50:28,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-08 08:50:29,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:29,325 INFO L225 Difference]: With dead ends: 2292 [2022-04-08 08:50:29,325 INFO L226 Difference]: Without dead ends: 1295 [2022-04-08 08:50:29,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:50:29,327 INFO L913 BasicCegarLoop]: 278 mSDtfsCounter, 101 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:29,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 675 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 612 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:50:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-04-08 08:50:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1080. [2022-04-08 08:50:29,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:29,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1295 states. Second operand has 1080 states, 1075 states have (on average 1.547906976744186) internal successors, (1664), 1075 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:29,416 INFO L74 IsIncluded]: Start isIncluded. First operand 1295 states. Second operand has 1080 states, 1075 states have (on average 1.547906976744186) internal successors, (1664), 1075 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:29,417 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand has 1080 states, 1075 states have (on average 1.547906976744186) internal successors, (1664), 1075 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:29,457 INFO L93 Difference]: Finished difference Result 1295 states and 1985 transitions. [2022-04-08 08:50:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1985 transitions. [2022-04-08 08:50:29,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:29,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:29,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.547906976744186) internal successors, (1664), 1075 states have internal predecessors, (1664), 3 states have call successors, (3), 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 1295 states. [2022-04-08 08:50:29,459 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.547906976744186) internal successors, (1664), 1075 states have internal predecessors, (1664), 3 states have call successors, (3), 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 1295 states. [2022-04-08 08:50:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:29,499 INFO L93 Difference]: Finished difference Result 1295 states and 1985 transitions. [2022-04-08 08:50:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1985 transitions. [2022-04-08 08:50:29,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:29,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:29,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:29,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.547906976744186) internal successors, (1664), 1075 states have internal predecessors, (1664), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1668 transitions. [2022-04-08 08:50:29,542 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1668 transitions. Word has length 131 [2022-04-08 08:50:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:29,542 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1668 transitions. [2022-04-08 08:50:29,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:29,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1668 transitions. [2022-04-08 08:50:33,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1668 edges. 1667 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1668 transitions. [2022-04-08 08:50:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 08:50:33,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:33,545 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:33,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:50:33,545 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash 777583331, now seen corresponding path program 1 times [2022-04-08 08:50:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:33,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845723586] [2022-04-08 08:50:33,617 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:33,617 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:33,617 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 777583331, now seen corresponding path program 2 times [2022-04-08 08:50:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:33,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298110826] [2022-04-08 08:50:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:33,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {134564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {134557#true} is VALID [2022-04-08 08:50:33,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {134557#true} assume true; {134557#true} is VALID [2022-04-08 08:50:33,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134557#true} {134557#true} #710#return; {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {134557#true} call ULTIMATE.init(); {134564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:33,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {134564#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {134557#true} assume true; {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134557#true} {134557#true} #710#return; {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {134557#true} call #t~ret161 := main(); {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {134557#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {134557#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L272 TraceCheckUtils]: 7: Hoare triple {134557#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {134557#true} is VALID [2022-04-08 08:50:33,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {134557#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {134557#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {134557#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {134557#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {134557#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {134557#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {134557#true} assume !false; {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {134557#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {134557#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {134557#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {134557#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {134557#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {134557#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {134557#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {134557#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {134557#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {134557#true} assume 8464 == #t~mem55;havoc #t~mem55; {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {134557#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {134557#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {134557#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {134557#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {134557#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {134557#true} ~skip~0 := 0; {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {134557#true} assume !false; {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {134557#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {134557#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {134557#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {134557#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {134557#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {134557#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {134557#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {134557#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {134557#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {134557#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {134557#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {134557#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {134557#true} assume 8496 == #t~mem58;havoc #t~mem58; {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {134557#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {134557#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {134557#true} is VALID [2022-04-08 08:50:33,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {134557#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {134557#true} is VALID [2022-04-08 08:50:33,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {134557#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,821 INFO L290 TraceCheckUtils]: 70: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,821 INFO L290 TraceCheckUtils]: 71: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,822 INFO L290 TraceCheckUtils]: 72: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,823 INFO L290 TraceCheckUtils]: 75: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,823 INFO L290 TraceCheckUtils]: 76: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,824 INFO L290 TraceCheckUtils]: 77: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,824 INFO L290 TraceCheckUtils]: 78: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,824 INFO L290 TraceCheckUtils]: 79: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,825 INFO L290 TraceCheckUtils]: 80: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,826 INFO L290 TraceCheckUtils]: 84: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,827 INFO L290 TraceCheckUtils]: 85: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:50:33,827 INFO L290 TraceCheckUtils]: 86: Hoare triple {134562#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {134563#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-08 08:50:33,827 INFO L290 TraceCheckUtils]: 87: Hoare triple {134563#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {134558#false} is VALID [2022-04-08 08:50:33,827 INFO L290 TraceCheckUtils]: 88: Hoare triple {134558#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {134558#false} is VALID [2022-04-08 08:50:33,827 INFO L290 TraceCheckUtils]: 89: Hoare triple {134558#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {134558#false} is VALID [2022-04-08 08:50:33,827 INFO L290 TraceCheckUtils]: 90: Hoare triple {134558#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 91: Hoare triple {134558#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {134558#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {134558#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 94: Hoare triple {134558#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {134558#false} ~skip~0 := 0; {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {134558#false} assume !false; {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {134558#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 98: Hoare triple {134558#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 99: Hoare triple {134558#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 100: Hoare triple {134558#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 101: Hoare triple {134558#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 102: Hoare triple {134558#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 103: Hoare triple {134558#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 104: Hoare triple {134558#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,828 INFO L290 TraceCheckUtils]: 105: Hoare triple {134558#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 106: Hoare triple {134558#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 107: Hoare triple {134558#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 108: Hoare triple {134558#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 109: Hoare triple {134558#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 110: Hoare triple {134558#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 111: Hoare triple {134558#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 112: Hoare triple {134558#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 113: Hoare triple {134558#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 114: Hoare triple {134558#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 115: Hoare triple {134558#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 116: Hoare triple {134558#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 117: Hoare triple {134558#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 118: Hoare triple {134558#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,829 INFO L290 TraceCheckUtils]: 119: Hoare triple {134558#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 120: Hoare triple {134558#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 121: Hoare triple {134558#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 122: Hoare triple {134558#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 123: Hoare triple {134558#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 124: Hoare triple {134558#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 125: Hoare triple {134558#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 126: Hoare triple {134558#false} assume 8640 == #t~mem75;havoc #t~mem75; {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 127: Hoare triple {134558#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 128: Hoare triple {134558#false} assume !(9 == ~blastFlag~0); {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 129: Hoare triple {134558#false} assume 12 == ~blastFlag~0; {134558#false} is VALID [2022-04-08 08:50:33,830 INFO L290 TraceCheckUtils]: 130: Hoare triple {134558#false} assume !false; {134558#false} is VALID [2022-04-08 08:50:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:50:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:33,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298110826] [2022-04-08 08:50:33,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298110826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:33,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:33,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:33,831 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:33,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845723586] [2022-04-08 08:50:33,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845723586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:33,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:33,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:33,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982119032] [2022-04-08 08:50:33,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:33,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 131 [2022-04-08 08:50:33,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:33,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:33,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:33,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:33,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:33,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:33,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:33,911 INFO L87 Difference]: Start difference. First operand 1080 states and 1668 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:37,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:40,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:42,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:44,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:50:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:49,123 INFO L93 Difference]: Finished difference Result 2483 states and 3808 transitions. [2022-04-08 08:50:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 131 [2022-04-08 08:50:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-08 08:50:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-08 08:50:49,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-08 08:50:49,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:49,616 INFO L225 Difference]: With dead ends: 2483 [2022-04-08 08:50:49,616 INFO L226 Difference]: Without dead ends: 1429 [2022-04-08 08:50:49,618 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:50:49,621 INFO L913 BasicCegarLoop]: 139 mSDtfsCounter, 119 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:49,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 393 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 493 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-04-08 08:50:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2022-04-08 08:50:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1209. [2022-04-08 08:50:49,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:49,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1429 states. Second operand has 1209 states, 1204 states have (on average 1.553986710963455) internal successors, (1871), 1204 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:49,706 INFO L74 IsIncluded]: Start isIncluded. First operand 1429 states. Second operand has 1209 states, 1204 states have (on average 1.553986710963455) internal successors, (1871), 1204 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:49,707 INFO L87 Difference]: Start difference. First operand 1429 states. Second operand has 1209 states, 1204 states have (on average 1.553986710963455) internal successors, (1871), 1204 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:49,755 INFO L93 Difference]: Finished difference Result 1429 states and 2168 transitions. [2022-04-08 08:50:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2168 transitions. [2022-04-08 08:50:49,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:49,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:49,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 1209 states, 1204 states have (on average 1.553986710963455) internal successors, (1871), 1204 states have internal predecessors, (1871), 3 states have call successors, (3), 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 1429 states. [2022-04-08 08:50:49,757 INFO L87 Difference]: Start difference. First operand has 1209 states, 1204 states have (on average 1.553986710963455) internal successors, (1871), 1204 states have internal predecessors, (1871), 3 states have call successors, (3), 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 1429 states. [2022-04-08 08:50:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:49,816 INFO L93 Difference]: Finished difference Result 1429 states and 2168 transitions. [2022-04-08 08:50:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2168 transitions. [2022-04-08 08:50:49,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:49,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:49,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:49,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1204 states have (on average 1.553986710963455) internal successors, (1871), 1204 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1875 transitions. [2022-04-08 08:50:49,868 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1875 transitions. Word has length 131 [2022-04-08 08:50:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:49,868 INFO L478 AbstractCegarLoop]: Abstraction has 1209 states and 1875 transitions. [2022-04-08 08:50:49,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:49,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1209 states and 1875 transitions. [2022-04-08 08:50:54,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1875 edges. 1874 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1875 transitions. [2022-04-08 08:50:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 08:50:54,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:54,124 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:54,124 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 08:50:54,124 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:54,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 636807991, now seen corresponding path program 1 times [2022-04-08 08:50:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:54,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403736589] [2022-04-08 08:50:54,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:50:54,222 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:50:54,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 636807991, now seen corresponding path program 2 times [2022-04-08 08:50:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:54,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735562084] [2022-04-08 08:50:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:54,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {144818#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {144811#true} is VALID [2022-04-08 08:50:54,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {144811#true} assume true; {144811#true} is VALID [2022-04-08 08:50:54,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144811#true} {144811#true} #710#return; {144811#true} is VALID [2022-04-08 08:50:54,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {144811#true} call ULTIMATE.init(); {144818#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:50:54,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {144818#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {144811#true} is VALID [2022-04-08 08:50:54,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {144811#true} assume true; {144811#true} is VALID [2022-04-08 08:50:54,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144811#true} {144811#true} #710#return; {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {144811#true} call #t~ret161 := main(); {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {144811#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {144811#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L272 TraceCheckUtils]: 7: Hoare triple {144811#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {144811#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {144811#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {144811#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {144811#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {144811#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {144811#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {144811#true} assume !false; {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {144811#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {144811#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {144811#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {144811#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {144811#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {144811#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {144811#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {144811#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {144811#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {144811#true} assume 8464 == #t~mem55;havoc #t~mem55; {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {144811#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {144811#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {144811#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {144811#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {144811#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144811#true} is VALID [2022-04-08 08:50:54,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {144811#true} ~skip~0 := 0; {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {144811#true} assume !false; {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {144811#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {144811#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {144811#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {144811#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {144811#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {144811#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {144811#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {144811#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {144811#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {144811#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {144811#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {144811#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {144811#true} assume 8496 == #t~mem58;havoc #t~mem58; {144811#true} is VALID [2022-04-08 08:50:54,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {144811#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {144811#true} is VALID [2022-04-08 08:50:54,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {144811#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {144811#true} is VALID [2022-04-08 08:50:54,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {144811#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {144811#true} is VALID [2022-04-08 08:50:54,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {144811#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:50:54,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {144816#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144817#(= |ssl3_accept_#t~mem53| 8512)} is VALID [2022-04-08 08:50:54,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {144817#(= |ssl3_accept_#t~mem53| 8512)} assume 8481 == #t~mem53;havoc #t~mem53; {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {144812#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 63: Hoare triple {144812#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 64: Hoare triple {144812#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 65: Hoare triple {144812#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {144812#false} ~skip~0 := 0; {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 67: Hoare triple {144812#false} assume !false; {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 68: Hoare triple {144812#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 69: Hoare triple {144812#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 70: Hoare triple {144812#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 71: Hoare triple {144812#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {144812#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {144812#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 74: Hoare triple {144812#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,405 INFO L290 TraceCheckUtils]: 75: Hoare triple {144812#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 76: Hoare triple {144812#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 77: Hoare triple {144812#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 78: Hoare triple {144812#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 79: Hoare triple {144812#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 80: Hoare triple {144812#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 81: Hoare triple {144812#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 82: Hoare triple {144812#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 83: Hoare triple {144812#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 84: Hoare triple {144812#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 85: Hoare triple {144812#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 86: Hoare triple {144812#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 87: Hoare triple {144812#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 88: Hoare triple {144812#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 89: Hoare triple {144812#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,406 INFO L290 TraceCheckUtils]: 90: Hoare triple {144812#false} assume 8448 == #t~mem68;havoc #t~mem68; {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 91: Hoare triple {144812#false} assume !(~num1~0 > 0); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 92: Hoare triple {144812#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 93: Hoare triple {144812#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 94: Hoare triple {144812#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 95: Hoare triple {144812#false} ~skip~0 := 0; {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 96: Hoare triple {144812#false} assume !false; {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 97: Hoare triple {144812#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 98: Hoare triple {144812#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 99: Hoare triple {144812#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 100: Hoare triple {144812#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 101: Hoare triple {144812#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 102: Hoare triple {144812#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 103: Hoare triple {144812#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,407 INFO L290 TraceCheckUtils]: 104: Hoare triple {144812#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 105: Hoare triple {144812#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 106: Hoare triple {144812#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 107: Hoare triple {144812#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 108: Hoare triple {144812#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 109: Hoare triple {144812#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 110: Hoare triple {144812#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 111: Hoare triple {144812#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 112: Hoare triple {144812#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 113: Hoare triple {144812#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 114: Hoare triple {144812#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 115: Hoare triple {144812#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 116: Hoare triple {144812#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 117: Hoare triple {144812#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,408 INFO L290 TraceCheckUtils]: 118: Hoare triple {144812#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 119: Hoare triple {144812#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 120: Hoare triple {144812#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 121: Hoare triple {144812#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 122: Hoare triple {144812#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 123: Hoare triple {144812#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 124: Hoare triple {144812#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 125: Hoare triple {144812#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 126: Hoare triple {144812#false} assume 8640 == #t~mem75;havoc #t~mem75; {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 127: Hoare triple {144812#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 128: Hoare triple {144812#false} assume !(9 == ~blastFlag~0); {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 129: Hoare triple {144812#false} assume 12 == ~blastFlag~0; {144812#false} is VALID [2022-04-08 08:50:54,409 INFO L290 TraceCheckUtils]: 130: Hoare triple {144812#false} assume !false; {144812#false} is VALID [2022-04-08 08:50:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:50:54,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:54,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735562084] [2022-04-08 08:50:54,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735562084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:54,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:54,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:54,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:54,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403736589] [2022-04-08 08:50:54,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403736589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:54,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:54,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579213782] [2022-04-08 08:50:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 131 [2022-04-08 08:50:54,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:54,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:54,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:54,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:54,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:54,478 INFO L87 Difference]: Start difference. First operand 1209 states and 1875 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:50:56,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:01,628 INFO L93 Difference]: Finished difference Result 2658 states and 4105 transitions. [2022-04-08 08:51:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:51:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 131 [2022-04-08 08:51:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:51:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-08 08:51:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-04-08 08:51:01,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 560 transitions. [2022-04-08 08:51:02,008 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-08 08:51:02,086 INFO L225 Difference]: With dead ends: 2658 [2022-04-08 08:51:02,086 INFO L226 Difference]: Without dead ends: 1475 [2022-04-08 08:51:02,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:51:02,087 INFO L913 BasicCegarLoop]: 283 mSDtfsCounter, 100 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:51:02,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 685 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 615 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-08 08:51:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2022-04-08 08:51:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1206. [2022-04-08 08:51:02,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:51:02,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1475 states. Second operand has 1206 states, 1201 states have (on average 1.5553705245628642) internal successors, (1868), 1201 states have internal predecessors, (1868), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:02,197 INFO L74 IsIncluded]: Start isIncluded. First operand 1475 states. Second operand has 1206 states, 1201 states have (on average 1.5553705245628642) internal successors, (1868), 1201 states have internal predecessors, (1868), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:02,197 INFO L87 Difference]: Start difference. First operand 1475 states. Second operand has 1206 states, 1201 states have (on average 1.5553705245628642) internal successors, (1868), 1201 states have internal predecessors, (1868), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:02,247 INFO L93 Difference]: Finished difference Result 1475 states and 2258 transitions. [2022-04-08 08:51:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2258 transitions. [2022-04-08 08:51:02,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:02,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:02,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 1206 states, 1201 states have (on average 1.5553705245628642) internal successors, (1868), 1201 states have internal predecessors, (1868), 3 states have call successors, (3), 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 1475 states. [2022-04-08 08:51:02,250 INFO L87 Difference]: Start difference. First operand has 1206 states, 1201 states have (on average 1.5553705245628642) internal successors, (1868), 1201 states have internal predecessors, (1868), 3 states have call successors, (3), 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 1475 states. [2022-04-08 08:51:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:02,299 INFO L93 Difference]: Finished difference Result 1475 states and 2258 transitions. [2022-04-08 08:51:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2258 transitions. [2022-04-08 08:51:02,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:02,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:02,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:51:02,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:51:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1201 states have (on average 1.5553705245628642) internal successors, (1868), 1201 states have internal predecessors, (1868), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1872 transitions. [2022-04-08 08:51:02,352 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1872 transitions. Word has length 131 [2022-04-08 08:51:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:51:02,352 INFO L478 AbstractCegarLoop]: Abstraction has 1206 states and 1872 transitions. [2022-04-08 08:51:02,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:02,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1206 states and 1872 transitions. [2022-04-08 08:51:06,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1872 edges. 1871 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1872 transitions. [2022-04-08 08:51:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-08 08:51:06,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:51:06,689 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:51:06,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 08:51:06,689 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:51:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:51:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash -347293821, now seen corresponding path program 1 times [2022-04-08 08:51:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:06,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066099972] [2022-04-08 08:51:06,763 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:51:06,763 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:51:06,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:51:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash -347293821, now seen corresponding path program 2 times [2022-04-08 08:51:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:51:06,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313276789] [2022-04-08 08:51:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:51:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:51:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:06,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:51:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:06,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {155508#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {155501#true} is VALID [2022-04-08 08:51:06,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {155501#true} assume true; {155501#true} is VALID [2022-04-08 08:51:06,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155501#true} {155501#true} #710#return; {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {155501#true} call ULTIMATE.init(); {155508#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {155508#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {155501#true} assume true; {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155501#true} {155501#true} #710#return; {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {155501#true} call #t~ret161 := main(); {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {155501#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {155501#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L272 TraceCheckUtils]: 7: Hoare triple {155501#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {155501#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {155501#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {155501#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {155501#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {155501#true} is VALID [2022-04-08 08:51:06,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {155501#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {155501#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {155501#true} assume !false; {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {155501#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {155501#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {155501#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {155501#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {155501#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {155501#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {155501#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {155501#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {155501#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {155501#true} assume 8464 == #t~mem55;havoc #t~mem55; {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {155501#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {155501#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {155501#true} is VALID [2022-04-08 08:51:06,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {155501#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {155501#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {155501#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {155501#true} ~skip~0 := 0; {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {155501#true} assume !false; {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {155501#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {155501#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {155501#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {155501#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {155501#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {155501#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {155501#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {155501#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {155501#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {155501#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {155501#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {155501#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {155501#true} assume 8496 == #t~mem58;havoc #t~mem58; {155501#true} is VALID [2022-04-08 08:51:06,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {155501#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {155501#true} is VALID [2022-04-08 08:51:06,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {155501#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {155501#true} is VALID [2022-04-08 08:51:06,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {155501#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {155501#true} is VALID [2022-04-08 08:51:06,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {155501#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,954 INFO L290 TraceCheckUtils]: 57: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,957 INFO L290 TraceCheckUtils]: 67: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,958 INFO L290 TraceCheckUtils]: 70: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,958 INFO L290 TraceCheckUtils]: 71: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,959 INFO L290 TraceCheckUtils]: 72: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,959 INFO L290 TraceCheckUtils]: 73: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,960 INFO L290 TraceCheckUtils]: 75: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,960 INFO L290 TraceCheckUtils]: 76: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,961 INFO L290 TraceCheckUtils]: 77: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,961 INFO L290 TraceCheckUtils]: 78: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,961 INFO L290 TraceCheckUtils]: 79: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,962 INFO L290 TraceCheckUtils]: 80: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,962 INFO L290 TraceCheckUtils]: 81: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,962 INFO L290 TraceCheckUtils]: 82: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,963 INFO L290 TraceCheckUtils]: 83: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,963 INFO L290 TraceCheckUtils]: 84: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,963 INFO L290 TraceCheckUtils]: 85: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,964 INFO L290 TraceCheckUtils]: 86: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:06,964 INFO L290 TraceCheckUtils]: 87: Hoare triple {155506#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {155507#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-08 08:51:06,964 INFO L290 TraceCheckUtils]: 88: Hoare triple {155507#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {155502#false} is VALID [2022-04-08 08:51:06,964 INFO L290 TraceCheckUtils]: 89: Hoare triple {155502#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {155502#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 91: Hoare triple {155502#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 92: Hoare triple {155502#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 93: Hoare triple {155502#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 94: Hoare triple {155502#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 95: Hoare triple {155502#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 96: Hoare triple {155502#false} ~skip~0 := 0; {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 97: Hoare triple {155502#false} assume !false; {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {155502#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 99: Hoare triple {155502#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 100: Hoare triple {155502#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 101: Hoare triple {155502#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 102: Hoare triple {155502#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 103: Hoare triple {155502#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,965 INFO L290 TraceCheckUtils]: 104: Hoare triple {155502#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 105: Hoare triple {155502#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 106: Hoare triple {155502#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 107: Hoare triple {155502#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 108: Hoare triple {155502#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 109: Hoare triple {155502#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 110: Hoare triple {155502#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 111: Hoare triple {155502#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 112: Hoare triple {155502#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 113: Hoare triple {155502#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 114: Hoare triple {155502#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 115: Hoare triple {155502#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 116: Hoare triple {155502#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 117: Hoare triple {155502#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,966 INFO L290 TraceCheckUtils]: 118: Hoare triple {155502#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 119: Hoare triple {155502#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 120: Hoare triple {155502#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 121: Hoare triple {155502#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 122: Hoare triple {155502#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 123: Hoare triple {155502#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 124: Hoare triple {155502#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 125: Hoare triple {155502#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 126: Hoare triple {155502#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 127: Hoare triple {155502#false} assume 8640 == #t~mem75;havoc #t~mem75; {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 128: Hoare triple {155502#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 129: Hoare triple {155502#false} assume !(9 == ~blastFlag~0); {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 130: Hoare triple {155502#false} assume 12 == ~blastFlag~0; {155502#false} is VALID [2022-04-08 08:51:06,967 INFO L290 TraceCheckUtils]: 131: Hoare triple {155502#false} assume !false; {155502#false} is VALID [2022-04-08 08:51:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 08:51:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:51:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313276789] [2022-04-08 08:51:06,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313276789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:06,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:06,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:06,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:51:06,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066099972] [2022-04-08 08:51:06,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066099972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:06,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:06,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409516269] [2022-04-08 08:51:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:51:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-08 08:51:06,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:51:06,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:07,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:07,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:51:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:07,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:51:07,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:51:07,052 INFO L87 Difference]: Start difference. First operand 1206 states and 1872 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:12,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:18,961 INFO L93 Difference]: Finished difference Result 2615 states and 4024 transitions. [2022-04-08 08:51:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:51:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-08 08:51:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:51:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-08 08:51:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-08 08:51:18,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-08 08:51:19,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:19,450 INFO L225 Difference]: With dead ends: 2615 [2022-04-08 08:51:19,450 INFO L226 Difference]: Without dead ends: 1429 [2022-04-08 08:51:19,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:51:19,452 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 120 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:51:19,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 400 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 496 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-04-08 08:51:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2022-04-08 08:51:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1212. [2022-04-08 08:51:19,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:51:19,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1429 states. Second operand has 1212 states, 1207 states have (on average 1.5550952775476388) internal successors, (1877), 1207 states have internal predecessors, (1877), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:19,553 INFO L74 IsIncluded]: Start isIncluded. First operand 1429 states. Second operand has 1212 states, 1207 states have (on average 1.5550952775476388) internal successors, (1877), 1207 states have internal predecessors, (1877), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:19,554 INFO L87 Difference]: Start difference. First operand 1429 states. Second operand has 1212 states, 1207 states have (on average 1.5550952775476388) internal successors, (1877), 1207 states have internal predecessors, (1877), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:19,601 INFO L93 Difference]: Finished difference Result 1429 states and 2171 transitions. [2022-04-08 08:51:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2171 transitions. [2022-04-08 08:51:19,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:19,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:19,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 1212 states, 1207 states have (on average 1.5550952775476388) internal successors, (1877), 1207 states have internal predecessors, (1877), 3 states have call successors, (3), 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 1429 states. [2022-04-08 08:51:19,603 INFO L87 Difference]: Start difference. First operand has 1212 states, 1207 states have (on average 1.5550952775476388) internal successors, (1877), 1207 states have internal predecessors, (1877), 3 states have call successors, (3), 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 1429 states. [2022-04-08 08:51:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:19,650 INFO L93 Difference]: Finished difference Result 1429 states and 2171 transitions. [2022-04-08 08:51:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2171 transitions. [2022-04-08 08:51:19,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:19,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:19,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:51:19,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:51:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1207 states have (on average 1.5550952775476388) internal successors, (1877), 1207 states have internal predecessors, (1877), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1881 transitions. [2022-04-08 08:51:19,702 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1881 transitions. Word has length 132 [2022-04-08 08:51:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:51:19,702 INFO L478 AbstractCegarLoop]: Abstraction has 1212 states and 1881 transitions. [2022-04-08 08:51:19,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:19,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1212 states and 1881 transitions. [2022-04-08 08:51:24,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1881 edges. 1880 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1881 transitions. [2022-04-08 08:51:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-08 08:51:24,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:51:24,053 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:51:24,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-08 08:51:24,053 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:51:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:51:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -231720393, now seen corresponding path program 1 times [2022-04-08 08:51:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:24,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [223408462] [2022-04-08 08:51:24,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:51:24,130 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:51:24,130 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:51:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -231720393, now seen corresponding path program 2 times [2022-04-08 08:51:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:51:24,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210284048] [2022-04-08 08:51:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:51:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:51:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:51:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:24,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {166032#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {166025#true} is VALID [2022-04-08 08:51:24,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {166025#true} assume true; {166025#true} is VALID [2022-04-08 08:51:24,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166025#true} {166025#true} #710#return; {166025#true} is VALID [2022-04-08 08:51:24,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {166025#true} call ULTIMATE.init(); {166032#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:51:24,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {166032#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {166025#true} is VALID [2022-04-08 08:51:24,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {166025#true} assume true; {166025#true} is VALID [2022-04-08 08:51:24,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166025#true} {166025#true} #710#return; {166025#true} is VALID [2022-04-08 08:51:24,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {166025#true} call #t~ret161 := main(); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {166025#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {166025#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L272 TraceCheckUtils]: 7: Hoare triple {166025#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {166025#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {166025#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {166025#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {166025#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {166025#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {166025#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {166025#true} assume !false; {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {166025#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {166025#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {166025#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {166025#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {166025#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {166025#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {166025#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {166025#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {166025#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {166025#true} assume 8464 == #t~mem55;havoc #t~mem55; {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {166025#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {166025#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {166025#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {166025#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {166025#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {166025#true} ~skip~0 := 0; {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {166025#true} assume !false; {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {166025#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {166025#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {166025#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {166025#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {166025#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {166025#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {166025#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {166025#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {166025#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {166025#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {166025#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {166025#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {166025#true} assume 8496 == #t~mem58;havoc #t~mem58; {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {166025#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {166025#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {166025#true} is VALID [2022-04-08 08:51:24,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {166025#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {166025#true} is VALID [2022-04-08 08:51:24,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {166025#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,312 INFO L290 TraceCheckUtils]: 72: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:24,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {166030#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {166031#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-08 08:51:24,313 INFO L290 TraceCheckUtils]: 74: Hoare triple {166031#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {166026#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 76: Hoare triple {166026#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 77: Hoare triple {166026#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 78: Hoare triple {166026#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 79: Hoare triple {166026#false} ~skip~0 := 0; {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 80: Hoare triple {166026#false} assume !false; {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 81: Hoare triple {166026#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 82: Hoare triple {166026#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 83: Hoare triple {166026#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 84: Hoare triple {166026#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 85: Hoare triple {166026#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 86: Hoare triple {166026#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 87: Hoare triple {166026#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,314 INFO L290 TraceCheckUtils]: 88: Hoare triple {166026#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 89: Hoare triple {166026#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 90: Hoare triple {166026#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 91: Hoare triple {166026#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 92: Hoare triple {166026#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 93: Hoare triple {166026#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 94: Hoare triple {166026#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 95: Hoare triple {166026#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 96: Hoare triple {166026#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 97: Hoare triple {166026#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 98: Hoare triple {166026#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 99: Hoare triple {166026#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 100: Hoare triple {166026#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 101: Hoare triple {166026#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,315 INFO L290 TraceCheckUtils]: 102: Hoare triple {166026#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 103: Hoare triple {166026#false} assume 8448 == #t~mem68;havoc #t~mem68; {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 104: Hoare triple {166026#false} assume !(~num1~0 > 0); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 105: Hoare triple {166026#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 106: Hoare triple {166026#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 107: Hoare triple {166026#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 108: Hoare triple {166026#false} ~skip~0 := 0; {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 109: Hoare triple {166026#false} assume !false; {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 110: Hoare triple {166026#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 111: Hoare triple {166026#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 112: Hoare triple {166026#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 113: Hoare triple {166026#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 114: Hoare triple {166026#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 115: Hoare triple {166026#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,316 INFO L290 TraceCheckUtils]: 116: Hoare triple {166026#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 117: Hoare triple {166026#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 118: Hoare triple {166026#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 119: Hoare triple {166026#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 120: Hoare triple {166026#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 121: Hoare triple {166026#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 122: Hoare triple {166026#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 123: Hoare triple {166026#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 124: Hoare triple {166026#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 125: Hoare triple {166026#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 126: Hoare triple {166026#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 127: Hoare triple {166026#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 128: Hoare triple {166026#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 129: Hoare triple {166026#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 130: Hoare triple {166026#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,317 INFO L290 TraceCheckUtils]: 131: Hoare triple {166026#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 132: Hoare triple {166026#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 133: Hoare triple {166026#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 134: Hoare triple {166026#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 135: Hoare triple {166026#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 136: Hoare triple {166026#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 137: Hoare triple {166026#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 138: Hoare triple {166026#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 139: Hoare triple {166026#false} assume 8640 == #t~mem75;havoc #t~mem75; {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 140: Hoare triple {166026#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 141: Hoare triple {166026#false} assume !(9 == ~blastFlag~0); {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 142: Hoare triple {166026#false} assume 12 == ~blastFlag~0; {166026#false} is VALID [2022-04-08 08:51:24,318 INFO L290 TraceCheckUtils]: 143: Hoare triple {166026#false} assume !false; {166026#false} is VALID [2022-04-08 08:51:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:51:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:51:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210284048] [2022-04-08 08:51:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210284048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:24,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:24,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:24,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:51:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [223408462] [2022-04-08 08:51:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [223408462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:24,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:24,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188341322] [2022-04-08 08:51:24,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:51:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-08 08:51:24,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:51:24,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:24,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:24,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:51:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:51:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:51:24,399 INFO L87 Difference]: Start difference. First operand 1212 states and 1881 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:31,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:38,170 INFO L93 Difference]: Finished difference Result 2741 states and 4222 transitions. [2022-04-08 08:51:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:51:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 144 [2022-04-08 08:51:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:51:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-08 08:51:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-08 08:51:38,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-08 08:51:38,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:38,677 INFO L225 Difference]: With dead ends: 2741 [2022-04-08 08:51:38,677 INFO L226 Difference]: Without dead ends: 1555 [2022-04-08 08:51:38,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:51:38,678 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 131 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:51:38,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 404 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 08:51:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2022-04-08 08:51:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1302. [2022-04-08 08:51:38,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:51:38,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1555 states. Second operand has 1302 states, 1297 states have (on average 1.5466461063993833) internal successors, (2006), 1297 states have internal predecessors, (2006), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:38,802 INFO L74 IsIncluded]: Start isIncluded. First operand 1555 states. Second operand has 1302 states, 1297 states have (on average 1.5466461063993833) internal successors, (2006), 1297 states have internal predecessors, (2006), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:38,803 INFO L87 Difference]: Start difference. First operand 1555 states. Second operand has 1302 states, 1297 states have (on average 1.5466461063993833) internal successors, (2006), 1297 states have internal predecessors, (2006), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:38,864 INFO L93 Difference]: Finished difference Result 1555 states and 2354 transitions. [2022-04-08 08:51:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2354 transitions. [2022-04-08 08:51:38,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:38,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:38,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 1302 states, 1297 states have (on average 1.5466461063993833) internal successors, (2006), 1297 states have internal predecessors, (2006), 3 states have call successors, (3), 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 1555 states. [2022-04-08 08:51:38,867 INFO L87 Difference]: Start difference. First operand has 1302 states, 1297 states have (on average 1.5466461063993833) internal successors, (2006), 1297 states have internal predecessors, (2006), 3 states have call successors, (3), 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 1555 states. [2022-04-08 08:51:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:38,929 INFO L93 Difference]: Finished difference Result 1555 states and 2354 transitions. [2022-04-08 08:51:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2354 transitions. [2022-04-08 08:51:38,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:38,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:38,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:51:38,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:51:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1297 states have (on average 1.5466461063993833) internal successors, (2006), 1297 states have internal predecessors, (2006), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2010 transitions. [2022-04-08 08:51:39,014 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2010 transitions. Word has length 144 [2022-04-08 08:51:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:51:39,015 INFO L478 AbstractCegarLoop]: Abstraction has 1302 states and 2010 transitions. [2022-04-08 08:51:39,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:39,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1302 states and 2010 transitions. [2022-04-08 08:51:43,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2010 edges. 2009 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2010 transitions. [2022-04-08 08:51:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 08:51:43,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:51:43,598 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:51:43,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-08 08:51:43,598 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:51:43,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:51:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2028072046, now seen corresponding path program 1 times [2022-04-08 08:51:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:43,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045376410] [2022-04-08 08:51:43,677 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:51:43,677 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:51:43,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:51:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2028072046, now seen corresponding path program 2 times [2022-04-08 08:51:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:51:43,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475855256] [2022-04-08 08:51:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:51:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:51:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:51:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:51:43,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {177240#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {177233#true} is VALID [2022-04-08 08:51:43,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {177233#true} assume true; {177233#true} is VALID [2022-04-08 08:51:43,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177233#true} {177233#true} #710#return; {177233#true} is VALID [2022-04-08 08:51:43,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {177233#true} call ULTIMATE.init(); {177240#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:51:43,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {177240#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {177233#true} is VALID [2022-04-08 08:51:43,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {177233#true} assume true; {177233#true} is VALID [2022-04-08 08:51:43,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177233#true} {177233#true} #710#return; {177233#true} is VALID [2022-04-08 08:51:43,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {177233#true} call #t~ret161 := main(); {177233#true} is VALID [2022-04-08 08:51:43,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {177233#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {177233#true} is VALID [2022-04-08 08:51:43,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {177233#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,862 INFO L272 TraceCheckUtils]: 7: Hoare triple {177233#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {177233#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {177233#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {177233#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {177233#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {177233#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {177233#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {177233#true} assume !false; {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {177233#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {177233#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {177233#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {177233#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {177233#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {177233#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {177233#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {177233#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {177233#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {177233#true} assume 8464 == #t~mem55;havoc #t~mem55; {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {177233#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {177233#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {177233#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {177233#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {177233#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {177233#true} ~skip~0 := 0; {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {177233#true} assume !false; {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {177233#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {177233#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {177233#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {177233#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {177233#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {177233#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {177233#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {177233#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {177233#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {177233#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {177233#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {177233#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {177233#true} assume 8496 == #t~mem58;havoc #t~mem58; {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {177233#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {177233#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {177233#true} is VALID [2022-04-08 08:51:43,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {177233#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {177233#true} is VALID [2022-04-08 08:51:43,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {177233#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:51:43,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {177238#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {177239#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-08 08:51:43,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {177239#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {177234#false} is VALID [2022-04-08 08:51:43,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {177234#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {177234#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {177234#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {177234#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {177234#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {177234#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {177234#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {177234#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {177234#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {177234#false} ~skip~0 := 0; {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 68: Hoare triple {177234#false} assume !false; {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 69: Hoare triple {177234#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 70: Hoare triple {177234#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 71: Hoare triple {177234#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 72: Hoare triple {177234#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,870 INFO L290 TraceCheckUtils]: 73: Hoare triple {177234#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 74: Hoare triple {177234#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {177234#false} assume 8480 == #t~mem52;havoc #t~mem52; {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 76: Hoare triple {177234#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 77: Hoare triple {177234#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {177234#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 79: Hoare triple {177234#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 80: Hoare triple {177234#false} ~skip~0 := 0; {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 81: Hoare triple {177234#false} assume !false; {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 82: Hoare triple {177234#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 83: Hoare triple {177234#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 84: Hoare triple {177234#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {177234#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {177234#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {177234#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,871 INFO L290 TraceCheckUtils]: 88: Hoare triple {177234#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {177234#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {177234#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {177234#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {177234#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {177234#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 94: Hoare triple {177234#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 95: Hoare triple {177234#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 96: Hoare triple {177234#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 97: Hoare triple {177234#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 98: Hoare triple {177234#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 99: Hoare triple {177234#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 100: Hoare triple {177234#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 101: Hoare triple {177234#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 102: Hoare triple {177234#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,872 INFO L290 TraceCheckUtils]: 103: Hoare triple {177234#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 104: Hoare triple {177234#false} assume 8448 == #t~mem68;havoc #t~mem68; {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 105: Hoare triple {177234#false} assume !(~num1~0 > 0); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 106: Hoare triple {177234#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 107: Hoare triple {177234#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 108: Hoare triple {177234#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 109: Hoare triple {177234#false} ~skip~0 := 0; {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 110: Hoare triple {177234#false} assume !false; {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 111: Hoare triple {177234#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {177234#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 113: Hoare triple {177234#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 114: Hoare triple {177234#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 115: Hoare triple {177234#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 116: Hoare triple {177234#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 117: Hoare triple {177234#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,873 INFO L290 TraceCheckUtils]: 118: Hoare triple {177234#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {177234#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {177234#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 121: Hoare triple {177234#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 122: Hoare triple {177234#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 123: Hoare triple {177234#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 124: Hoare triple {177234#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 125: Hoare triple {177234#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 126: Hoare triple {177234#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 127: Hoare triple {177234#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 128: Hoare triple {177234#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 129: Hoare triple {177234#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 130: Hoare triple {177234#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 131: Hoare triple {177234#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 132: Hoare triple {177234#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,874 INFO L290 TraceCheckUtils]: 133: Hoare triple {177234#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 134: Hoare triple {177234#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 135: Hoare triple {177234#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 136: Hoare triple {177234#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 137: Hoare triple {177234#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 138: Hoare triple {177234#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 139: Hoare triple {177234#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 140: Hoare triple {177234#false} assume 8640 == #t~mem75;havoc #t~mem75; {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 141: Hoare triple {177234#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 142: Hoare triple {177234#false} assume !(9 == ~blastFlag~0); {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 143: Hoare triple {177234#false} assume 12 == ~blastFlag~0; {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L290 TraceCheckUtils]: 144: Hoare triple {177234#false} assume !false; {177234#false} is VALID [2022-04-08 08:51:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 08:51:43,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:51:43,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475855256] [2022-04-08 08:51:43,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475855256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:43,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:43,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:43,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:51:43,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045376410] [2022-04-08 08:51:43,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045376410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:51:43,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:51:43,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:51:43,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893391806] [2022-04-08 08:51:43,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:51:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-08 08:51:43,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:51:43,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:43,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:43,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:51:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:51:43,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:51:43,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:51:43,943 INFO L87 Difference]: Start difference. First operand 1302 states and 2010 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:49,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:51:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:58,024 INFO L93 Difference]: Finished difference Result 2378 states and 3634 transitions. [2022-04-08 08:51:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:51:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-08 08:51:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:51:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:51:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 08:51:58,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 08:51:58,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:51:58,507 INFO L225 Difference]: With dead ends: 2378 [2022-04-08 08:51:58,507 INFO L226 Difference]: Without dead ends: 1492 [2022-04-08 08:51:58,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:51:58,508 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 141 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:51:58,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 420 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-08 08:51:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-04-08 08:51:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1302. [2022-04-08 08:51:58,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:51:58,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1492 states. Second operand has 1302 states, 1297 states have (on average 1.5265998457979955) internal successors, (1980), 1297 states have internal predecessors, (1980), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:58,628 INFO L74 IsIncluded]: Start isIncluded. First operand 1492 states. Second operand has 1302 states, 1297 states have (on average 1.5265998457979955) internal successors, (1980), 1297 states have internal predecessors, (1980), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:58,629 INFO L87 Difference]: Start difference. First operand 1492 states. Second operand has 1302 states, 1297 states have (on average 1.5265998457979955) internal successors, (1980), 1297 states have internal predecessors, (1980), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:58,679 INFO L93 Difference]: Finished difference Result 1492 states and 2239 transitions. [2022-04-08 08:51:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2239 transitions. [2022-04-08 08:51:58,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:58,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:58,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 1302 states, 1297 states have (on average 1.5265998457979955) internal successors, (1980), 1297 states have internal predecessors, (1980), 3 states have call successors, (3), 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 1492 states. [2022-04-08 08:51:58,682 INFO L87 Difference]: Start difference. First operand has 1302 states, 1297 states have (on average 1.5265998457979955) internal successors, (1980), 1297 states have internal predecessors, (1980), 3 states have call successors, (3), 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 1492 states. [2022-04-08 08:51:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:51:58,733 INFO L93 Difference]: Finished difference Result 1492 states and 2239 transitions. [2022-04-08 08:51:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2239 transitions. [2022-04-08 08:51:58,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:51:58,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:51:58,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:51:58,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:51:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1297 states have (on average 1.5265998457979955) internal successors, (1980), 1297 states have internal predecessors, (1980), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1984 transitions. [2022-04-08 08:51:58,792 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1984 transitions. Word has length 145 [2022-04-08 08:51:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:51:58,792 INFO L478 AbstractCegarLoop]: Abstraction has 1302 states and 1984 transitions. [2022-04-08 08:51:58,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:51:58,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1302 states and 1984 transitions. [2022-04-08 08:52:03,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1984 edges. 1983 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1984 transitions. [2022-04-08 08:52:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 08:52:03,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:52:03,430 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 08:52:03,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-08 08:52:03,430 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:52:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:52:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash -901822382, now seen corresponding path program 1 times [2022-04-08 08:52:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:03,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961349629] [2022-04-08 08:52:03,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:52:03,533 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:52:03,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:52:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash -901822382, now seen corresponding path program 2 times [2022-04-08 08:52:03,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:52:03,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829801613] [2022-04-08 08:52:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:52:03,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:52:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:52:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:03,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {187596#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {187589#true} is VALID [2022-04-08 08:52:03,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {187589#true} assume true; {187589#true} is VALID [2022-04-08 08:52:03,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187589#true} {187589#true} #710#return; {187589#true} is VALID [2022-04-08 08:52:03,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {187589#true} call ULTIMATE.init(); {187596#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {187596#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {187589#true} assume true; {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187589#true} {187589#true} #710#return; {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {187589#true} call #t~ret161 := main(); {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {187589#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {187589#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L272 TraceCheckUtils]: 7: Hoare triple {187589#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {187589#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {187589#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {187589#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {187589#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {187589#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {187589#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {187589#true} assume !false; {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {187589#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {187589#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {187589#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {187589#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {187589#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {187589#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {187589#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {187589#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {187589#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {187589#true} assume 8464 == #t~mem55;havoc #t~mem55; {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {187589#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {187589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {187589#true} is VALID [2022-04-08 08:52:03,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {187589#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {187589#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {187589#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {187589#true} ~skip~0 := 0; {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {187589#true} assume !false; {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {187589#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {187589#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {187589#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {187589#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {187589#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {187589#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {187589#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {187589#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {187589#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {187589#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {187589#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {187589#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {187589#true} assume 8496 == #t~mem58;havoc #t~mem58; {187589#true} is VALID [2022-04-08 08:52:03,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {187589#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {187589#true} is VALID [2022-04-08 08:52:03,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {187589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {187589#true} is VALID [2022-04-08 08:52:03,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {187589#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {187589#true} is VALID [2022-04-08 08:52:03,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {187589#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,753 INFO L290 TraceCheckUtils]: 65: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,754 INFO L290 TraceCheckUtils]: 69: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,755 INFO L290 TraceCheckUtils]: 71: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,756 INFO L290 TraceCheckUtils]: 72: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:03,756 INFO L290 TraceCheckUtils]: 74: Hoare triple {187594#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {187595#(= |ssl3_accept_#t~mem67| 8656)} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 75: Hoare triple {187595#(= |ssl3_accept_#t~mem67| 8656)} assume 8561 == #t~mem67;havoc #t~mem67; {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 76: Hoare triple {187590#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 77: Hoare triple {187590#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 78: Hoare triple {187590#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 79: Hoare triple {187590#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {187590#false} ~skip~0 := 0; {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {187590#false} assume !false; {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {187590#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 83: Hoare triple {187590#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 84: Hoare triple {187590#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 85: Hoare triple {187590#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 86: Hoare triple {187590#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 87: Hoare triple {187590#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,757 INFO L290 TraceCheckUtils]: 88: Hoare triple {187590#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {187590#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 90: Hoare triple {187590#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 91: Hoare triple {187590#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {187590#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 93: Hoare triple {187590#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 94: Hoare triple {187590#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 95: Hoare triple {187590#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {187590#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 97: Hoare triple {187590#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {187590#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 99: Hoare triple {187590#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 100: Hoare triple {187590#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 101: Hoare triple {187590#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 102: Hoare triple {187590#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,758 INFO L290 TraceCheckUtils]: 103: Hoare triple {187590#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 104: Hoare triple {187590#false} assume 8448 == #t~mem68;havoc #t~mem68; {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 105: Hoare triple {187590#false} assume !(~num1~0 > 0); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 106: Hoare triple {187590#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 107: Hoare triple {187590#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 108: Hoare triple {187590#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 109: Hoare triple {187590#false} ~skip~0 := 0; {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 110: Hoare triple {187590#false} assume !false; {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 111: Hoare triple {187590#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 112: Hoare triple {187590#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 113: Hoare triple {187590#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 114: Hoare triple {187590#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 115: Hoare triple {187590#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 116: Hoare triple {187590#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,759 INFO L290 TraceCheckUtils]: 117: Hoare triple {187590#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 118: Hoare triple {187590#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 119: Hoare triple {187590#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 120: Hoare triple {187590#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 121: Hoare triple {187590#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 122: Hoare triple {187590#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 123: Hoare triple {187590#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 124: Hoare triple {187590#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 125: Hoare triple {187590#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 126: Hoare triple {187590#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 127: Hoare triple {187590#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 128: Hoare triple {187590#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 129: Hoare triple {187590#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 130: Hoare triple {187590#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 131: Hoare triple {187590#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,760 INFO L290 TraceCheckUtils]: 132: Hoare triple {187590#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 133: Hoare triple {187590#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 134: Hoare triple {187590#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 135: Hoare triple {187590#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 136: Hoare triple {187590#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 137: Hoare triple {187590#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 138: Hoare triple {187590#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 139: Hoare triple {187590#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 140: Hoare triple {187590#false} assume 8640 == #t~mem75;havoc #t~mem75; {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 141: Hoare triple {187590#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 142: Hoare triple {187590#false} assume !(9 == ~blastFlag~0); {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 143: Hoare triple {187590#false} assume 12 == ~blastFlag~0; {187590#false} is VALID [2022-04-08 08:52:03,761 INFO L290 TraceCheckUtils]: 144: Hoare triple {187590#false} assume !false; {187590#false} is VALID [2022-04-08 08:52:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:52:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:52:03,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829801613] [2022-04-08 08:52:03,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829801613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:03,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:03,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:03,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:52:03,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961349629] [2022-04-08 08:52:03,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961349629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:03,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:03,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288135810] [2022-04-08 08:52:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:52:03,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-08 08:52:03,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:52:03,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:03,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:03,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:52:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:52:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:52:03,827 INFO L87 Difference]: Start difference. First operand 1302 states and 1984 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:05,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:07,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:16,873 INFO L93 Difference]: Finished difference Result 2799 states and 4257 transitions. [2022-04-08 08:52:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:52:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-08 08:52:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:52:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-08 08:52:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-08 08:52:16,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 536 transitions. [2022-04-08 08:52:17,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:17,316 INFO L225 Difference]: With dead ends: 2799 [2022-04-08 08:52:17,316 INFO L226 Difference]: Without dead ends: 1523 [2022-04-08 08:52:17,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:52:17,319 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 69 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:52:17,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 647 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 564 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-08 08:52:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-04-08 08:52:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1398. [2022-04-08 08:52:17,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:52:17,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1523 states. Second operand has 1398 states, 1393 states have (on average 1.5247666905958364) internal successors, (2124), 1393 states have internal predecessors, (2124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:17,526 INFO L74 IsIncluded]: Start isIncluded. First operand 1523 states. Second operand has 1398 states, 1393 states have (on average 1.5247666905958364) internal successors, (2124), 1393 states have internal predecessors, (2124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:17,527 INFO L87 Difference]: Start difference. First operand 1523 states. Second operand has 1398 states, 1393 states have (on average 1.5247666905958364) internal successors, (2124), 1393 states have internal predecessors, (2124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:17,580 INFO L93 Difference]: Finished difference Result 1523 states and 2301 transitions. [2022-04-08 08:52:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2301 transitions. [2022-04-08 08:52:17,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:17,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:17,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 1398 states, 1393 states have (on average 1.5247666905958364) internal successors, (2124), 1393 states have internal predecessors, (2124), 3 states have call successors, (3), 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 1523 states. [2022-04-08 08:52:17,582 INFO L87 Difference]: Start difference. First operand has 1398 states, 1393 states have (on average 1.5247666905958364) internal successors, (2124), 1393 states have internal predecessors, (2124), 3 states have call successors, (3), 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 1523 states. [2022-04-08 08:52:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:17,635 INFO L93 Difference]: Finished difference Result 1523 states and 2301 transitions. [2022-04-08 08:52:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2301 transitions. [2022-04-08 08:52:17,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:17,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:17,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:52:17,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:52:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1393 states have (on average 1.5247666905958364) internal successors, (2124), 1393 states have internal predecessors, (2124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2128 transitions. [2022-04-08 08:52:17,703 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2128 transitions. Word has length 145 [2022-04-08 08:52:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:52:17,703 INFO L478 AbstractCegarLoop]: Abstraction has 1398 states and 2128 transitions. [2022-04-08 08:52:17,703 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:17,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1398 states and 2128 transitions. [2022-04-08 08:52:22,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2128 edges. 2127 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2128 transitions. [2022-04-08 08:52:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 08:52:22,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:52:22,554 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 08:52:22,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-08 08:52:22,554 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:52:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:52:22,555 INFO L85 PathProgramCache]: Analyzing trace with hash 699248724, now seen corresponding path program 1 times [2022-04-08 08:52:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:22,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910860026] [2022-04-08 08:52:22,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:52:22,632 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:52:22,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:52:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 699248724, now seen corresponding path program 2 times [2022-04-08 08:52:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:52:22,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824275752] [2022-04-08 08:52:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:52:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:52:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:52:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:22,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {199048#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {199041#true} is VALID [2022-04-08 08:52:22,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {199041#true} assume true; {199041#true} is VALID [2022-04-08 08:52:22,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {199041#true} {199041#true} #710#return; {199041#true} is VALID [2022-04-08 08:52:22,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {199041#true} call ULTIMATE.init(); {199048#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:52:22,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {199048#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {199041#true} is VALID [2022-04-08 08:52:22,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {199041#true} assume true; {199041#true} is VALID [2022-04-08 08:52:22,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199041#true} {199041#true} #710#return; {199041#true} is VALID [2022-04-08 08:52:22,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {199041#true} call #t~ret161 := main(); {199041#true} is VALID [2022-04-08 08:52:22,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {199041#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {199041#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L272 TraceCheckUtils]: 7: Hoare triple {199041#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {199041#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {199041#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {199041#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {199041#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {199041#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {199041#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {199041#true} assume !false; {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {199041#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {199041#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {199041#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {199041#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {199041#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {199041#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {199041#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {199041#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {199041#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {199041#true} assume 8464 == #t~mem55;havoc #t~mem55; {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {199041#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {199041#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {199041#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {199041#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {199041#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {199041#true} ~skip~0 := 0; {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {199041#true} assume !false; {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {199041#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {199041#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {199041#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {199041#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {199041#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {199041#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {199041#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {199041#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {199041#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {199041#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {199041#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {199041#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {199041#true} assume 8496 == #t~mem58;havoc #t~mem58; {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {199041#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {199041#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {199041#true} is VALID [2022-04-08 08:52:22,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {199041#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {199041#true} is VALID [2022-04-08 08:52:22,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {199041#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,792 INFO L290 TraceCheckUtils]: 57: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,792 INFO L290 TraceCheckUtils]: 58: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,792 INFO L290 TraceCheckUtils]: 59: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,793 INFO L290 TraceCheckUtils]: 60: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,795 INFO L290 TraceCheckUtils]: 67: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,796 INFO L290 TraceCheckUtils]: 69: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,796 INFO L290 TraceCheckUtils]: 70: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,796 INFO L290 TraceCheckUtils]: 71: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,797 INFO L290 TraceCheckUtils]: 72: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {199046#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {199047#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {199047#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {199042#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {199042#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {199042#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {199042#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {199042#false} ~skip~0 := 0; {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {199042#false} assume !false; {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 82: Hoare triple {199042#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {199042#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {199042#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {199042#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 86: Hoare triple {199042#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 87: Hoare triple {199042#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 88: Hoare triple {199042#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 89: Hoare triple {199042#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 90: Hoare triple {199042#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 91: Hoare triple {199042#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 92: Hoare triple {199042#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {199042#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {199042#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 95: Hoare triple {199042#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {199042#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 97: Hoare triple {199042#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 98: Hoare triple {199042#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,799 INFO L290 TraceCheckUtils]: 99: Hoare triple {199042#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 100: Hoare triple {199042#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 101: Hoare triple {199042#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 102: Hoare triple {199042#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 103: Hoare triple {199042#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 104: Hoare triple {199042#false} assume 8448 == #t~mem68;havoc #t~mem68; {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 105: Hoare triple {199042#false} assume !(~num1~0 > 0); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 106: Hoare triple {199042#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 107: Hoare triple {199042#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 108: Hoare triple {199042#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 109: Hoare triple {199042#false} ~skip~0 := 0; {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 110: Hoare triple {199042#false} assume !false; {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 111: Hoare triple {199042#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 112: Hoare triple {199042#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 113: Hoare triple {199042#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,800 INFO L290 TraceCheckUtils]: 114: Hoare triple {199042#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 115: Hoare triple {199042#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 116: Hoare triple {199042#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 117: Hoare triple {199042#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 118: Hoare triple {199042#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 119: Hoare triple {199042#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 120: Hoare triple {199042#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 121: Hoare triple {199042#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 122: Hoare triple {199042#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 123: Hoare triple {199042#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 124: Hoare triple {199042#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 125: Hoare triple {199042#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 126: Hoare triple {199042#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 127: Hoare triple {199042#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 128: Hoare triple {199042#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,801 INFO L290 TraceCheckUtils]: 129: Hoare triple {199042#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,802 INFO L290 TraceCheckUtils]: 130: Hoare triple {199042#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,802 INFO L290 TraceCheckUtils]: 131: Hoare triple {199042#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,802 INFO L290 TraceCheckUtils]: 132: Hoare triple {199042#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 133: Hoare triple {199042#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 134: Hoare triple {199042#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 135: Hoare triple {199042#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 136: Hoare triple {199042#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 137: Hoare triple {199042#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 138: Hoare triple {199042#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 139: Hoare triple {199042#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 140: Hoare triple {199042#false} assume 8640 == #t~mem75;havoc #t~mem75; {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 141: Hoare triple {199042#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 142: Hoare triple {199042#false} assume !(9 == ~blastFlag~0); {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 143: Hoare triple {199042#false} assume 12 == ~blastFlag~0; {199042#false} is VALID [2022-04-08 08:52:22,813 INFO L290 TraceCheckUtils]: 144: Hoare triple {199042#false} assume !false; {199042#false} is VALID [2022-04-08 08:52:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:52:22,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:52:22,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824275752] [2022-04-08 08:52:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824275752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:22,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:22,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:52:22,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910860026] [2022-04-08 08:52:22,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910860026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:22,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:22,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424493728] [2022-04-08 08:52:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:52:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-08 08:52:22,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:52:22,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:22,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:22,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:52:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:52:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:52:22,890 INFO L87 Difference]: Start difference. First operand 1398 states and 2128 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:30,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:34,230 INFO L93 Difference]: Finished difference Result 2960 states and 4480 transitions. [2022-04-08 08:52:34,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:52:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-08 08:52:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:52:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:52:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:52:34,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 08:52:34,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:34,728 INFO L225 Difference]: With dead ends: 2960 [2022-04-08 08:52:34,729 INFO L226 Difference]: Without dead ends: 1588 [2022-04-08 08:52:34,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:52:34,730 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 122 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 08:52:34,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 420 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 08:52:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-04-08 08:52:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1302. [2022-04-08 08:52:34,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:52:34,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1588 states. Second operand has 1302 states, 1297 states have (on average 1.51272166538165) internal successors, (1962), 1297 states have internal predecessors, (1962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:34,858 INFO L74 IsIncluded]: Start isIncluded. First operand 1588 states. Second operand has 1302 states, 1297 states have (on average 1.51272166538165) internal successors, (1962), 1297 states have internal predecessors, (1962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:34,859 INFO L87 Difference]: Start difference. First operand 1588 states. Second operand has 1302 states, 1297 states have (on average 1.51272166538165) internal successors, (1962), 1297 states have internal predecessors, (1962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:34,923 INFO L93 Difference]: Finished difference Result 1588 states and 2365 transitions. [2022-04-08 08:52:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2365 transitions. [2022-04-08 08:52:34,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:34,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:34,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 1302 states, 1297 states have (on average 1.51272166538165) internal successors, (1962), 1297 states have internal predecessors, (1962), 3 states have call successors, (3), 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 1588 states. [2022-04-08 08:52:34,926 INFO L87 Difference]: Start difference. First operand has 1302 states, 1297 states have (on average 1.51272166538165) internal successors, (1962), 1297 states have internal predecessors, (1962), 3 states have call successors, (3), 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 1588 states. [2022-04-08 08:52:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:34,990 INFO L93 Difference]: Finished difference Result 1588 states and 2365 transitions. [2022-04-08 08:52:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2365 transitions. [2022-04-08 08:52:34,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:34,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:34,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:52:34,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:52:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1297 states have (on average 1.51272166538165) internal successors, (1962), 1297 states have internal predecessors, (1962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1966 transitions. [2022-04-08 08:52:35,061 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1966 transitions. Word has length 145 [2022-04-08 08:52:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:52:35,061 INFO L478 AbstractCegarLoop]: Abstraction has 1302 states and 1966 transitions. [2022-04-08 08:52:35,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:35,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1302 states and 1966 transitions. [2022-04-08 08:52:39,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1966 edges. 1965 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1966 transitions. [2022-04-08 08:52:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-08 08:52:39,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:52:39,906 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:52:39,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-08 08:52:39,906 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:52:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:52:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1230175570, now seen corresponding path program 1 times [2022-04-08 08:52:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:39,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729134356] [2022-04-08 08:52:40,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:52:40,009 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:52:40,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:52:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1230175570, now seen corresponding path program 2 times [2022-04-08 08:52:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:52:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721326442] [2022-04-08 08:52:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:52:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:52:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:52:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:52:40,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {210760#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {210753#true} is VALID [2022-04-08 08:52:40,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {210753#true} assume true; {210753#true} is VALID [2022-04-08 08:52:40,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210753#true} {210753#true} #710#return; {210753#true} is VALID [2022-04-08 08:52:40,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {210753#true} call ULTIMATE.init(); {210760#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:52:40,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {210760#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {210753#true} is VALID [2022-04-08 08:52:40,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {210753#true} assume true; {210753#true} is VALID [2022-04-08 08:52:40,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210753#true} {210753#true} #710#return; {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {210753#true} call #t~ret161 := main(); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {210753#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {210753#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L272 TraceCheckUtils]: 7: Hoare triple {210753#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {210753#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {210753#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {210753#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {210753#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {210753#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {210753#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {210753#true} assume !false; {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {210753#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {210753#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {210753#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {210753#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {210753#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {210753#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {210753#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {210753#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {210753#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {210753#true} assume 8464 == #t~mem55;havoc #t~mem55; {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {210753#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {210753#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {210753#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {210753#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {210753#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {210753#true} ~skip~0 := 0; {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {210753#true} assume !false; {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {210753#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {210753#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {210753#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {210753#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {210753#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {210753#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {210753#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {210753#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {210753#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {210753#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {210753#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {210753#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {210753#true} assume 8496 == #t~mem58;havoc #t~mem58; {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 45: Hoare triple {210753#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {210753#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {210753#true} is VALID [2022-04-08 08:52:40,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {210753#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {210753#true} is VALID [2022-04-08 08:52:40,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {210753#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {210758#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {210759#(= |ssl3_accept_#t~mem64| 8656)} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {210759#(= |ssl3_accept_#t~mem64| 8656)} assume 8544 == #t~mem64;havoc #t~mem64; {210754#false} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {210754#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {210754#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {210754#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {210754#false} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {210754#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {210754#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {210754#false} is VALID [2022-04-08 08:52:40,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {210754#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 79: Hoare triple {210754#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {210754#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 81: Hoare triple {210754#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 82: Hoare triple {210754#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 83: Hoare triple {210754#false} ~skip~0 := 0; {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {210754#false} assume !false; {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {210754#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 86: Hoare triple {210754#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 87: Hoare triple {210754#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 88: Hoare triple {210754#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 89: Hoare triple {210754#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 90: Hoare triple {210754#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 91: Hoare triple {210754#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,204 INFO L290 TraceCheckUtils]: 92: Hoare triple {210754#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {210754#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 94: Hoare triple {210754#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 95: Hoare triple {210754#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 96: Hoare triple {210754#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 97: Hoare triple {210754#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 98: Hoare triple {210754#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 99: Hoare triple {210754#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 100: Hoare triple {210754#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 101: Hoare triple {210754#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 102: Hoare triple {210754#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 103: Hoare triple {210754#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 104: Hoare triple {210754#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 105: Hoare triple {210754#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 106: Hoare triple {210754#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,205 INFO L290 TraceCheckUtils]: 107: Hoare triple {210754#false} assume 8448 == #t~mem68;havoc #t~mem68; {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 108: Hoare triple {210754#false} assume !(~num1~0 > 0); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 109: Hoare triple {210754#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 110: Hoare triple {210754#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 111: Hoare triple {210754#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 112: Hoare triple {210754#false} ~skip~0 := 0; {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 113: Hoare triple {210754#false} assume !false; {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 114: Hoare triple {210754#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 115: Hoare triple {210754#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 116: Hoare triple {210754#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 117: Hoare triple {210754#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 118: Hoare triple {210754#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 119: Hoare triple {210754#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 120: Hoare triple {210754#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 121: Hoare triple {210754#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,206 INFO L290 TraceCheckUtils]: 122: Hoare triple {210754#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 123: Hoare triple {210754#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 124: Hoare triple {210754#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 125: Hoare triple {210754#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 126: Hoare triple {210754#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 127: Hoare triple {210754#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 128: Hoare triple {210754#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 129: Hoare triple {210754#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 130: Hoare triple {210754#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 131: Hoare triple {210754#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 132: Hoare triple {210754#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 133: Hoare triple {210754#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 134: Hoare triple {210754#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 135: Hoare triple {210754#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 136: Hoare triple {210754#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,207 INFO L290 TraceCheckUtils]: 137: Hoare triple {210754#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 138: Hoare triple {210754#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 139: Hoare triple {210754#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 140: Hoare triple {210754#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 141: Hoare triple {210754#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 142: Hoare triple {210754#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 143: Hoare triple {210754#false} assume 8640 == #t~mem75;havoc #t~mem75; {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 144: Hoare triple {210754#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 145: Hoare triple {210754#false} assume !(9 == ~blastFlag~0); {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 146: Hoare triple {210754#false} assume 12 == ~blastFlag~0; {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L290 TraceCheckUtils]: 147: Hoare triple {210754#false} assume !false; {210754#false} is VALID [2022-04-08 08:52:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:52:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:52:40,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721326442] [2022-04-08 08:52:40,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721326442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:40,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:40,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:40,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:52:40,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729134356] [2022-04-08 08:52:40,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729134356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:52:40,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:52:40,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:52:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723710460] [2022-04-08 08:52:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:52:40,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 148 [2022-04-08 08:52:40,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:52:40,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:40,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:40,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:52:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:52:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:52:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:52:40,285 INFO L87 Difference]: Start difference. First operand 1302 states and 1966 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:43,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:46,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:52:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:54,434 INFO L93 Difference]: Finished difference Result 2799 states and 4218 transitions. [2022-04-08 08:52:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:52:54,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 148 [2022-04-08 08:52:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:52:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-08 08:52:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-08 08:52:54,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 535 transitions. [2022-04-08 08:52:54,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:52:54,888 INFO L225 Difference]: With dead ends: 2799 [2022-04-08 08:52:54,888 INFO L226 Difference]: Without dead ends: 1523 [2022-04-08 08:52:54,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:52:54,889 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 71 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:52:54,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 645 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 08:52:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-04-08 08:52:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1389. [2022-04-08 08:52:55,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:52:55,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1523 states. Second operand has 1389 states, 1384 states have (on average 1.5108381502890174) internal successors, (2091), 1384 states have internal predecessors, (2091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:55,014 INFO L74 IsIncluded]: Start isIncluded. First operand 1523 states. Second operand has 1389 states, 1384 states have (on average 1.5108381502890174) internal successors, (2091), 1384 states have internal predecessors, (2091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:55,014 INFO L87 Difference]: Start difference. First operand 1523 states. Second operand has 1389 states, 1384 states have (on average 1.5108381502890174) internal successors, (2091), 1384 states have internal predecessors, (2091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:55,093 INFO L93 Difference]: Finished difference Result 1523 states and 2280 transitions. [2022-04-08 08:52:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2280 transitions. [2022-04-08 08:52:55,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:55,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:55,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 1389 states, 1384 states have (on average 1.5108381502890174) internal successors, (2091), 1384 states have internal predecessors, (2091), 3 states have call successors, (3), 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 1523 states. [2022-04-08 08:52:55,096 INFO L87 Difference]: Start difference. First operand has 1389 states, 1384 states have (on average 1.5108381502890174) internal successors, (2091), 1384 states have internal predecessors, (2091), 3 states have call successors, (3), 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 1523 states. [2022-04-08 08:52:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:52:55,149 INFO L93 Difference]: Finished difference Result 1523 states and 2280 transitions. [2022-04-08 08:52:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2280 transitions. [2022-04-08 08:52:55,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:52:55,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:52:55,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:52:55,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:52:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1384 states have (on average 1.5108381502890174) internal successors, (2091), 1384 states have internal predecessors, (2091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2095 transitions. [2022-04-08 08:52:55,215 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2095 transitions. Word has length 148 [2022-04-08 08:52:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:52:55,215 INFO L478 AbstractCegarLoop]: Abstraction has 1389 states and 2095 transitions. [2022-04-08 08:52:55,216 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:52:55,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1389 states and 2095 transitions. [2022-04-08 08:53:00,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2095 edges. 2094 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2095 transitions. [2022-04-08 08:53:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-08 08:53:00,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:53:00,085 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:53:00,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-08 08:53:00,085 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:53:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:53:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1167294960, now seen corresponding path program 1 times [2022-04-08 08:53:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:00,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [692147527] [2022-04-08 08:53:00,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:53:00,177 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:53:00,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:53:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1167294960, now seen corresponding path program 2 times [2022-04-08 08:53:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:53:00,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740995640] [2022-04-08 08:53:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:53:00,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:53:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:00,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:53:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:00,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {222194#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {222187#true} is VALID [2022-04-08 08:53:00,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {222187#true} assume true; {222187#true} is VALID [2022-04-08 08:53:00,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222187#true} {222187#true} #710#return; {222187#true} is VALID [2022-04-08 08:53:00,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {222187#true} call ULTIMATE.init(); {222194#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:53:00,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {222194#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {222187#true} is VALID [2022-04-08 08:53:00,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {222187#true} assume true; {222187#true} is VALID [2022-04-08 08:53:00,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222187#true} {222187#true} #710#return; {222187#true} is VALID [2022-04-08 08:53:00,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {222187#true} call #t~ret161 := main(); {222187#true} is VALID [2022-04-08 08:53:00,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {222187#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {222187#true} is VALID [2022-04-08 08:53:00,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {222187#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,343 INFO L272 TraceCheckUtils]: 7: Hoare triple {222187#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {222187#true} is VALID [2022-04-08 08:53:00,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {222187#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {222187#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {222187#true} is VALID [2022-04-08 08:53:00,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {222187#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {222187#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {222187#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {222187#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {222187#true} assume !false; {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {222187#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {222187#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {222187#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {222187#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {222187#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {222187#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {222187#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {222187#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {222187#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {222187#true} assume 8464 == #t~mem55;havoc #t~mem55; {222187#true} is VALID [2022-04-08 08:53:00,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {222187#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {222187#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {222187#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {222187#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {222187#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {222187#true} ~skip~0 := 0; {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {222187#true} assume !false; {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {222187#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {222187#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {222187#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {222187#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {222187#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {222187#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {222187#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {222187#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {222187#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {222187#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {222187#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {222187#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {222187#true} assume 8496 == #t~mem58;havoc #t~mem58; {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {222187#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {222187#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {222187#true} is VALID [2022-04-08 08:53:00,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {222187#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {222187#true} is VALID [2022-04-08 08:53:00,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {222187#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,363 INFO L290 TraceCheckUtils]: 67: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,363 INFO L290 TraceCheckUtils]: 68: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,364 INFO L290 TraceCheckUtils]: 69: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:53:00,364 INFO L290 TraceCheckUtils]: 71: Hoare triple {222192#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {222193#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {222193#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {222188#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 74: Hoare triple {222188#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 75: Hoare triple {222188#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 76: Hoare triple {222188#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 77: Hoare triple {222188#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 78: Hoare triple {222188#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 79: Hoare triple {222188#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 80: Hoare triple {222188#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 81: Hoare triple {222188#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 82: Hoare triple {222188#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 83: Hoare triple {222188#false} ~skip~0 := 0; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 84: Hoare triple {222188#false} assume !false; {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {222188#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {222188#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 87: Hoare triple {222188#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 88: Hoare triple {222188#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 89: Hoare triple {222188#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {222188#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 91: Hoare triple {222188#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 92: Hoare triple {222188#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {222188#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 94: Hoare triple {222188#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 95: Hoare triple {222188#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 96: Hoare triple {222188#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 97: Hoare triple {222188#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 98: Hoare triple {222188#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 99: Hoare triple {222188#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 100: Hoare triple {222188#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,366 INFO L290 TraceCheckUtils]: 101: Hoare triple {222188#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 102: Hoare triple {222188#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 103: Hoare triple {222188#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 104: Hoare triple {222188#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 105: Hoare triple {222188#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 106: Hoare triple {222188#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 107: Hoare triple {222188#false} assume 8448 == #t~mem68;havoc #t~mem68; {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 108: Hoare triple {222188#false} assume !(~num1~0 > 0); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 109: Hoare triple {222188#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 110: Hoare triple {222188#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 111: Hoare triple {222188#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 112: Hoare triple {222188#false} ~skip~0 := 0; {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 113: Hoare triple {222188#false} assume !false; {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 114: Hoare triple {222188#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 115: Hoare triple {222188#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,367 INFO L290 TraceCheckUtils]: 116: Hoare triple {222188#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 117: Hoare triple {222188#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 118: Hoare triple {222188#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 119: Hoare triple {222188#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 120: Hoare triple {222188#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 121: Hoare triple {222188#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 122: Hoare triple {222188#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 123: Hoare triple {222188#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 124: Hoare triple {222188#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 125: Hoare triple {222188#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 126: Hoare triple {222188#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 127: Hoare triple {222188#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 128: Hoare triple {222188#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 129: Hoare triple {222188#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 130: Hoare triple {222188#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,368 INFO L290 TraceCheckUtils]: 131: Hoare triple {222188#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 132: Hoare triple {222188#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 133: Hoare triple {222188#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 134: Hoare triple {222188#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 135: Hoare triple {222188#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 136: Hoare triple {222188#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 137: Hoare triple {222188#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 138: Hoare triple {222188#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 139: Hoare triple {222188#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 140: Hoare triple {222188#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 141: Hoare triple {222188#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 142: Hoare triple {222188#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 143: Hoare triple {222188#false} assume 8640 == #t~mem75;havoc #t~mem75; {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 144: Hoare triple {222188#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 145: Hoare triple {222188#false} assume !(9 == ~blastFlag~0); {222188#false} is VALID [2022-04-08 08:53:00,369 INFO L290 TraceCheckUtils]: 146: Hoare triple {222188#false} assume 12 == ~blastFlag~0; {222188#false} is VALID [2022-04-08 08:53:00,370 INFO L290 TraceCheckUtils]: 147: Hoare triple {222188#false} assume !false; {222188#false} is VALID [2022-04-08 08:53:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:53:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:53:00,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740995640] [2022-04-08 08:53:00,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740995640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:00,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:00,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:00,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:53:00,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [692147527] [2022-04-08 08:53:00,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [692147527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:00,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:00,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:00,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172514833] [2022-04-08 08:53:00,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:53:00,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 148 [2022-04-08 08:53:00,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:53:00,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:00,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:00,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:53:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:00,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:53:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:53:00,432 INFO L87 Difference]: Start difference. First operand 1389 states and 2095 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:07,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:11,268 INFO L93 Difference]: Finished difference Result 3068 states and 4606 transitions. [2022-04-08 08:53:11,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:53:11,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 148 [2022-04-08 08:53:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:53:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:53:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:53:11,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-08 08:53:11,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:11,747 INFO L225 Difference]: With dead ends: 3068 [2022-04-08 08:53:11,747 INFO L226 Difference]: Without dead ends: 1705 [2022-04-08 08:53:11,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:53:11,748 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 124 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-08 08:53:11,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 420 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-08 08:53:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2022-04-08 08:53:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1386. [2022-04-08 08:53:11,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:53:11,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1705 states. Second operand has 1386 states, 1381 states have (on average 1.5010861694424331) internal successors, (2073), 1381 states have internal predecessors, (2073), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:11,892 INFO L74 IsIncluded]: Start isIncluded. First operand 1705 states. Second operand has 1386 states, 1381 states have (on average 1.5010861694424331) internal successors, (2073), 1381 states have internal predecessors, (2073), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:11,893 INFO L87 Difference]: Start difference. First operand 1705 states. Second operand has 1386 states, 1381 states have (on average 1.5010861694424331) internal successors, (2073), 1381 states have internal predecessors, (2073), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:11,964 INFO L93 Difference]: Finished difference Result 1705 states and 2521 transitions. [2022-04-08 08:53:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2521 transitions. [2022-04-08 08:53:11,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:11,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:11,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 1386 states, 1381 states have (on average 1.5010861694424331) internal successors, (2073), 1381 states have internal predecessors, (2073), 3 states have call successors, (3), 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 1705 states. [2022-04-08 08:53:11,967 INFO L87 Difference]: Start difference. First operand has 1386 states, 1381 states have (on average 1.5010861694424331) internal successors, (2073), 1381 states have internal predecessors, (2073), 3 states have call successors, (3), 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 1705 states. [2022-04-08 08:53:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:12,039 INFO L93 Difference]: Finished difference Result 1705 states and 2521 transitions. [2022-04-08 08:53:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2521 transitions. [2022-04-08 08:53:12,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:12,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:12,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:53:12,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:53:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1381 states have (on average 1.5010861694424331) internal successors, (2073), 1381 states have internal predecessors, (2073), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2077 transitions. [2022-04-08 08:53:12,105 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2077 transitions. Word has length 148 [2022-04-08 08:53:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:53:12,105 INFO L478 AbstractCegarLoop]: Abstraction has 1386 states and 2077 transitions. [2022-04-08 08:53:12,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:12,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1386 states and 2077 transitions. [2022-04-08 08:53:17,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2077 edges. 2076 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2077 transitions. [2022-04-08 08:53:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 08:53:17,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:53:17,107 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:53:17,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-08 08:53:17,107 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:53:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:53:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1039412595, now seen corresponding path program 1 times [2022-04-08 08:53:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:17,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1830278092] [2022-04-08 08:53:17,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:53:17,195 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:53:17,195 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:53:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1039412595, now seen corresponding path program 2 times [2022-04-08 08:53:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:53:17,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713265626] [2022-04-08 08:53:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:53:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:53:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:53:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:17,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {234524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {234517#true} is VALID [2022-04-08 08:53:17,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {234517#true} assume true; {234517#true} is VALID [2022-04-08 08:53:17,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234517#true} {234517#true} #710#return; {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {234517#true} call ULTIMATE.init(); {234524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {234524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {234517#true} assume true; {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234517#true} {234517#true} #710#return; {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {234517#true} call #t~ret161 := main(); {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {234517#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {234517#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L272 TraceCheckUtils]: 7: Hoare triple {234517#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {234517#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {234517#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {234517#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {234517#true} is VALID [2022-04-08 08:53:17,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {234517#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {234517#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {234517#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {234517#true} assume !false; {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {234517#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {234517#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {234517#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {234517#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {234517#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {234517#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {234517#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {234517#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {234517#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {234517#true} assume 8464 == #t~mem55;havoc #t~mem55; {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {234517#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {234517#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {234517#true} is VALID [2022-04-08 08:53:17,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {234517#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {234517#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {234517#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {234517#true} ~skip~0 := 0; {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {234517#true} assume !false; {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {234517#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {234517#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {234517#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {234517#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {234517#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {234517#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {234517#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {234517#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {234517#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {234517#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {234517#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {234517#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {234517#true} assume 8496 == #t~mem58;havoc #t~mem58; {234517#true} is VALID [2022-04-08 08:53:17,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {234517#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {234517#true} is VALID [2022-04-08 08:53:17,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {234517#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {234517#true} is VALID [2022-04-08 08:53:17,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {234517#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {234517#true} is VALID [2022-04-08 08:53:17,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {234517#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,376 INFO L290 TraceCheckUtils]: 69: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,376 INFO L290 TraceCheckUtils]: 70: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:53:17,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {234522#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {234523#(= |ssl3_accept_#t~mem65| 8656)} is VALID [2022-04-08 08:53:17,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {234523#(= |ssl3_accept_#t~mem65| 8656)} assume 8545 == #t~mem65;havoc #t~mem65; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {234518#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {234518#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {234518#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {234518#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {234518#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {234518#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {234518#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {234518#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {234518#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 83: Hoare triple {234518#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 84: Hoare triple {234518#false} ~skip~0 := 0; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {234518#false} assume !false; {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 86: Hoare triple {234518#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,378 INFO L290 TraceCheckUtils]: 87: Hoare triple {234518#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 88: Hoare triple {234518#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 89: Hoare triple {234518#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 90: Hoare triple {234518#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 91: Hoare triple {234518#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 92: Hoare triple {234518#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {234518#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 94: Hoare triple {234518#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 95: Hoare triple {234518#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {234518#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {234518#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 98: Hoare triple {234518#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 99: Hoare triple {234518#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 100: Hoare triple {234518#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 101: Hoare triple {234518#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,379 INFO L290 TraceCheckUtils]: 102: Hoare triple {234518#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 103: Hoare triple {234518#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 104: Hoare triple {234518#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 105: Hoare triple {234518#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 106: Hoare triple {234518#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 107: Hoare triple {234518#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {234518#false} assume 8448 == #t~mem68;havoc #t~mem68; {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {234518#false} assume !(~num1~0 > 0); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {234518#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 111: Hoare triple {234518#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 112: Hoare triple {234518#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 113: Hoare triple {234518#false} ~skip~0 := 0; {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 114: Hoare triple {234518#false} assume !false; {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 115: Hoare triple {234518#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {234518#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {234518#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {234518#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 119: Hoare triple {234518#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {234518#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 121: Hoare triple {234518#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 122: Hoare triple {234518#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 123: Hoare triple {234518#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 124: Hoare triple {234518#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 125: Hoare triple {234518#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 126: Hoare triple {234518#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 127: Hoare triple {234518#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 128: Hoare triple {234518#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 129: Hoare triple {234518#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 130: Hoare triple {234518#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 131: Hoare triple {234518#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 132: Hoare triple {234518#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,381 INFO L290 TraceCheckUtils]: 133: Hoare triple {234518#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 134: Hoare triple {234518#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 135: Hoare triple {234518#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 136: Hoare triple {234518#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 137: Hoare triple {234518#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 138: Hoare triple {234518#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 139: Hoare triple {234518#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 140: Hoare triple {234518#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 141: Hoare triple {234518#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 142: Hoare triple {234518#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 143: Hoare triple {234518#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 144: Hoare triple {234518#false} assume 8640 == #t~mem75;havoc #t~mem75; {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 145: Hoare triple {234518#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 146: Hoare triple {234518#false} assume !(9 == ~blastFlag~0); {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 147: Hoare triple {234518#false} assume 12 == ~blastFlag~0; {234518#false} is VALID [2022-04-08 08:53:17,382 INFO L290 TraceCheckUtils]: 148: Hoare triple {234518#false} assume !false; {234518#false} is VALID [2022-04-08 08:53:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 08:53:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:53:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713265626] [2022-04-08 08:53:17,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713265626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:17,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:17,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:17,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:53:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1830278092] [2022-04-08 08:53:17,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1830278092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:17,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:17,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:17,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619548378] [2022-04-08 08:53:17,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:53:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-08 08:53:17,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:53:17,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:17,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:17,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:53:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:17,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:53:17,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:53:17,460 INFO L87 Difference]: Start difference. First operand 1386 states and 2077 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:21,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:23,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:26,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:28,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:32,681 INFO L93 Difference]: Finished difference Result 2943 states and 4398 transitions. [2022-04-08 08:53:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:53:32,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-08 08:53:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:53:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-04-08 08:53:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-04-08 08:53:32,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 521 transitions. [2022-04-08 08:53:32,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:33,093 INFO L225 Difference]: With dead ends: 2943 [2022-04-08 08:53:33,093 INFO L226 Difference]: Without dead ends: 1583 [2022-04-08 08:53:33,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:53:33,095 INFO L913 BasicCegarLoop]: 258 mSDtfsCounter, 60 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:53:33,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 635 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-08 08:53:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-04-08 08:53:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1476. [2022-04-08 08:53:33,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:53:33,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1583 states. Second operand has 1476 states, 1471 states have (on average 1.4989802855200545) internal successors, (2205), 1471 states have internal predecessors, (2205), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:33,246 INFO L74 IsIncluded]: Start isIncluded. First operand 1583 states. Second operand has 1476 states, 1471 states have (on average 1.4989802855200545) internal successors, (2205), 1471 states have internal predecessors, (2205), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:33,247 INFO L87 Difference]: Start difference. First operand 1583 states. Second operand has 1476 states, 1471 states have (on average 1.4989802855200545) internal successors, (2205), 1471 states have internal predecessors, (2205), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:33,309 INFO L93 Difference]: Finished difference Result 1583 states and 2349 transitions. [2022-04-08 08:53:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2349 transitions. [2022-04-08 08:53:33,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:33,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:33,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 1476 states, 1471 states have (on average 1.4989802855200545) internal successors, (2205), 1471 states have internal predecessors, (2205), 3 states have call successors, (3), 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 1583 states. [2022-04-08 08:53:33,311 INFO L87 Difference]: Start difference. First operand has 1476 states, 1471 states have (on average 1.4989802855200545) internal successors, (2205), 1471 states have internal predecessors, (2205), 3 states have call successors, (3), 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 1583 states. [2022-04-08 08:53:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:33,374 INFO L93 Difference]: Finished difference Result 1583 states and 2349 transitions. [2022-04-08 08:53:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2349 transitions. [2022-04-08 08:53:33,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:33,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:33,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:53:33,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:53:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1471 states have (on average 1.4989802855200545) internal successors, (2205), 1471 states have internal predecessors, (2205), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2209 transitions. [2022-04-08 08:53:33,450 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2209 transitions. Word has length 149 [2022-04-08 08:53:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:53:33,450 INFO L478 AbstractCegarLoop]: Abstraction has 1476 states and 2209 transitions. [2022-04-08 08:53:33,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:33,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1476 states and 2209 transitions. [2022-04-08 08:53:38,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2209 edges. 2208 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2209 transitions. [2022-04-08 08:53:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 08:53:38,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:53:38,551 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:53:38,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-08 08:53:38,551 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:53:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:53:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1948412303, now seen corresponding path program 1 times [2022-04-08 08:53:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:38,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558083325] [2022-04-08 08:53:38,638 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:53:38,639 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:53:38,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:53:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1948412303, now seen corresponding path program 2 times [2022-04-08 08:53:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:53:38,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172424639] [2022-04-08 08:53:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:53:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:53:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:53:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:38,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {246540#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {246533#true} is VALID [2022-04-08 08:53:38,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {246533#true} assume true; {246533#true} is VALID [2022-04-08 08:53:38,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {246533#true} {246533#true} #710#return; {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {246533#true} call ULTIMATE.init(); {246540#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {246540#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {246533#true} assume true; {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246533#true} {246533#true} #710#return; {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {246533#true} call #t~ret161 := main(); {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {246533#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {246533#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L272 TraceCheckUtils]: 7: Hoare triple {246533#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {246533#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {246533#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {246533#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {246533#true} is VALID [2022-04-08 08:53:38,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {246533#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {246533#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {246533#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {246533#true} assume !false; {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {246533#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {246533#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {246533#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {246533#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {246533#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {246533#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {246533#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {246533#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {246533#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {246533#true} assume 8464 == #t~mem55;havoc #t~mem55; {246533#true} is VALID [2022-04-08 08:53:38,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {246533#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {246533#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {246533#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {246533#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {246533#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {246533#true} ~skip~0 := 0; {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {246533#true} assume !false; {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {246533#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {246533#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {246533#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {246533#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {246533#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {246533#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {246533#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {246533#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {246533#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {246533#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {246533#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {246533#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {246533#true} assume 8496 == #t~mem58;havoc #t~mem58; {246533#true} is VALID [2022-04-08 08:53:38,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {246533#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {246533#true} is VALID [2022-04-08 08:53:38,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {246533#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {246533#true} is VALID [2022-04-08 08:53:38,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {246533#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {246533#true} is VALID [2022-04-08 08:53:38,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {246533#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-08 08:53:38,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {246538#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {246539#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-08 08:53:38,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {246539#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {246534#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {246534#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {246534#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {246534#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {246534#false} assume 8545 == #t~mem65;havoc #t~mem65; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {246534#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {246534#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {246534#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {246534#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 78: Hoare triple {246534#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {246534#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {246534#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {246534#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 82: Hoare triple {246534#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 83: Hoare triple {246534#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {246534#false} ~skip~0 := 0; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 85: Hoare triple {246534#false} assume !false; {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 86: Hoare triple {246534#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,862 INFO L290 TraceCheckUtils]: 87: Hoare triple {246534#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 88: Hoare triple {246534#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 89: Hoare triple {246534#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 90: Hoare triple {246534#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 91: Hoare triple {246534#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 92: Hoare triple {246534#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 93: Hoare triple {246534#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 94: Hoare triple {246534#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 95: Hoare triple {246534#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 96: Hoare triple {246534#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 97: Hoare triple {246534#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 98: Hoare triple {246534#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 99: Hoare triple {246534#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 100: Hoare triple {246534#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 101: Hoare triple {246534#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,863 INFO L290 TraceCheckUtils]: 102: Hoare triple {246534#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 103: Hoare triple {246534#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 104: Hoare triple {246534#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 105: Hoare triple {246534#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 106: Hoare triple {246534#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 107: Hoare triple {246534#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 108: Hoare triple {246534#false} assume 8448 == #t~mem68;havoc #t~mem68; {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 109: Hoare triple {246534#false} assume !(~num1~0 > 0); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 110: Hoare triple {246534#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 111: Hoare triple {246534#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 112: Hoare triple {246534#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 113: Hoare triple {246534#false} ~skip~0 := 0; {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 114: Hoare triple {246534#false} assume !false; {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 115: Hoare triple {246534#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,864 INFO L290 TraceCheckUtils]: 116: Hoare triple {246534#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 117: Hoare triple {246534#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 118: Hoare triple {246534#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 119: Hoare triple {246534#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 120: Hoare triple {246534#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 121: Hoare triple {246534#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 122: Hoare triple {246534#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 123: Hoare triple {246534#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 124: Hoare triple {246534#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 125: Hoare triple {246534#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 126: Hoare triple {246534#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 127: Hoare triple {246534#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 128: Hoare triple {246534#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 129: Hoare triple {246534#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,865 INFO L290 TraceCheckUtils]: 130: Hoare triple {246534#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 131: Hoare triple {246534#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 132: Hoare triple {246534#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 133: Hoare triple {246534#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 134: Hoare triple {246534#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 135: Hoare triple {246534#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 136: Hoare triple {246534#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 137: Hoare triple {246534#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 138: Hoare triple {246534#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 139: Hoare triple {246534#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 140: Hoare triple {246534#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 141: Hoare triple {246534#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 142: Hoare triple {246534#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 143: Hoare triple {246534#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 144: Hoare triple {246534#false} assume 8640 == #t~mem75;havoc #t~mem75; {246534#false} is VALID [2022-04-08 08:53:38,866 INFO L290 TraceCheckUtils]: 145: Hoare triple {246534#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {246534#false} is VALID [2022-04-08 08:53:38,867 INFO L290 TraceCheckUtils]: 146: Hoare triple {246534#false} assume !(9 == ~blastFlag~0); {246534#false} is VALID [2022-04-08 08:53:38,867 INFO L290 TraceCheckUtils]: 147: Hoare triple {246534#false} assume 12 == ~blastFlag~0; {246534#false} is VALID [2022-04-08 08:53:38,867 INFO L290 TraceCheckUtils]: 148: Hoare triple {246534#false} assume !false; {246534#false} is VALID [2022-04-08 08:53:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 08:53:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:53:38,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172424639] [2022-04-08 08:53:38,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172424639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:38,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:38,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:38,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:53:38,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558083325] [2022-04-08 08:53:38,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558083325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:38,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:38,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164559599] [2022-04-08 08:53:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:53:38,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-08 08:53:38,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:53:38,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:38,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:38,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:53:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:53:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:53:38,944 INFO L87 Difference]: Start difference. First operand 1476 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:43,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:45,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:53:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:49,423 INFO L93 Difference]: Finished difference Result 2979 states and 4467 transitions. [2022-04-08 08:53:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:53:49,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-08 08:53:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:53:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:53:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:53:49,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-08 08:53:49,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:49,816 INFO L225 Difference]: With dead ends: 2979 [2022-04-08 08:53:49,816 INFO L226 Difference]: Without dead ends: 1529 [2022-04-08 08:53:49,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:53:49,818 INFO L913 BasicCegarLoop]: 243 mSDtfsCounter, 27 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:53:49,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 605 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-04-08 08:53:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2022-04-08 08:53:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1497. [2022-04-08 08:53:49,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:53:49,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1529 states. Second operand has 1497 states, 1492 states have (on average 1.5020107238605898) internal successors, (2241), 1492 states have internal predecessors, (2241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:49,985 INFO L74 IsIncluded]: Start isIncluded. First operand 1529 states. Second operand has 1497 states, 1492 states have (on average 1.5020107238605898) internal successors, (2241), 1492 states have internal predecessors, (2241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:49,986 INFO L87 Difference]: Start difference. First operand 1529 states. Second operand has 1497 states, 1492 states have (on average 1.5020107238605898) internal successors, (2241), 1492 states have internal predecessors, (2241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:50,038 INFO L93 Difference]: Finished difference Result 1529 states and 2286 transitions. [2022-04-08 08:53:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2286 transitions. [2022-04-08 08:53:50,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:50,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:50,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 1497 states, 1492 states have (on average 1.5020107238605898) internal successors, (2241), 1492 states have internal predecessors, (2241), 3 states have call successors, (3), 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 1529 states. [2022-04-08 08:53:50,040 INFO L87 Difference]: Start difference. First operand has 1497 states, 1492 states have (on average 1.5020107238605898) internal successors, (2241), 1492 states have internal predecessors, (2241), 3 states have call successors, (3), 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 1529 states. [2022-04-08 08:53:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:53:50,093 INFO L93 Difference]: Finished difference Result 1529 states and 2286 transitions. [2022-04-08 08:53:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2286 transitions. [2022-04-08 08:53:50,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:53:50,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:53:50,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:53:50,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:53:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1492 states have (on average 1.5020107238605898) internal successors, (2241), 1492 states have internal predecessors, (2241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2245 transitions. [2022-04-08 08:53:50,171 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2245 transitions. Word has length 149 [2022-04-08 08:53:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:53:50,171 INFO L478 AbstractCegarLoop]: Abstraction has 1497 states and 2245 transitions. [2022-04-08 08:53:50,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:50,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1497 states and 2245 transitions. [2022-04-08 08:53:55,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2245 edges. 2244 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2245 transitions. [2022-04-08 08:53:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 08:53:55,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:53:55,477 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-04-08 08:53:55,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-08 08:53:55,477 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:53:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:53:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1264827437, now seen corresponding path program 1 times [2022-04-08 08:53:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:55,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1944019738] [2022-04-08 08:53:55,583 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:53:55,583 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:53:55,583 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:53:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1264827437, now seen corresponding path program 2 times [2022-04-08 08:53:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:53:55,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840391883] [2022-04-08 08:53:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:53:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:53:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:55,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:53:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:53:55,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {258562#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {258555#true} is VALID [2022-04-08 08:53:55,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {258555#true} assume true; {258555#true} is VALID [2022-04-08 08:53:55,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258555#true} {258555#true} #710#return; {258555#true} is VALID [2022-04-08 08:53:55,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {258555#true} call ULTIMATE.init(); {258562#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:53:55,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {258562#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {258555#true} is VALID [2022-04-08 08:53:55,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {258555#true} assume true; {258555#true} is VALID [2022-04-08 08:53:55,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258555#true} {258555#true} #710#return; {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {258555#true} call #t~ret161 := main(); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {258555#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {258555#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L272 TraceCheckUtils]: 7: Hoare triple {258555#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {258555#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {258555#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {258555#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {258555#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {258555#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {258555#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {258555#true} assume !false; {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {258555#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {258555#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {258555#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {258555#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {258555#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {258555#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {258555#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {258555#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {258555#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {258555#true} assume 8464 == #t~mem55;havoc #t~mem55; {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {258555#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {258555#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {258555#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {258555#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {258555#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {258555#true} ~skip~0 := 0; {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {258555#true} assume !false; {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {258555#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {258555#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {258555#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {258555#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {258555#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {258555#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {258555#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {258555#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {258555#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {258555#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {258555#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {258555#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {258555#true} assume 8496 == #t~mem58;havoc #t~mem58; {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {258555#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {258555#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {258555#true} is VALID [2022-04-08 08:53:55,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {258555#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {258555#true} is VALID [2022-04-08 08:53:55,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {258555#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} ~skip~0 := 0; {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,843 INFO L290 TraceCheckUtils]: 54: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,844 INFO L290 TraceCheckUtils]: 55: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,844 INFO L290 TraceCheckUtils]: 56: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,844 INFO L290 TraceCheckUtils]: 57: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,846 INFO L290 TraceCheckUtils]: 62: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,847 INFO L290 TraceCheckUtils]: 66: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-08 08:53:55,847 INFO L290 TraceCheckUtils]: 67: Hoare triple {258560#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {258561#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 68: Hoare triple {258561#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 69: Hoare triple {258556#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {258556#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {258556#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {258556#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {258556#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {258556#false} ~skip~0 := 0; {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 75: Hoare triple {258556#false} assume !false; {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 76: Hoare triple {258556#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {258556#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 78: Hoare triple {258556#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 79: Hoare triple {258556#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 80: Hoare triple {258556#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {258556#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 82: Hoare triple {258556#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 83: Hoare triple {258556#false} assume 8481 == #t~mem53;havoc #t~mem53; {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 84: Hoare triple {258556#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 85: Hoare triple {258556#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 86: Hoare triple {258556#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 87: Hoare triple {258556#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 88: Hoare triple {258556#false} ~skip~0 := 0; {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 89: Hoare triple {258556#false} assume !false; {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 90: Hoare triple {258556#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 91: Hoare triple {258556#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 92: Hoare triple {258556#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 93: Hoare triple {258556#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 94: Hoare triple {258556#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 95: Hoare triple {258556#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,849 INFO L290 TraceCheckUtils]: 96: Hoare triple {258556#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 97: Hoare triple {258556#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 98: Hoare triple {258556#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 99: Hoare triple {258556#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 100: Hoare triple {258556#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 101: Hoare triple {258556#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 102: Hoare triple {258556#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 103: Hoare triple {258556#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 104: Hoare triple {258556#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 105: Hoare triple {258556#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 106: Hoare triple {258556#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 107: Hoare triple {258556#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 108: Hoare triple {258556#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 109: Hoare triple {258556#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 110: Hoare triple {258556#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 111: Hoare triple {258556#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,850 INFO L290 TraceCheckUtils]: 112: Hoare triple {258556#false} assume 8448 == #t~mem68;havoc #t~mem68; {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 113: Hoare triple {258556#false} assume !(~num1~0 > 0); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 114: Hoare triple {258556#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 115: Hoare triple {258556#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 116: Hoare triple {258556#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 117: Hoare triple {258556#false} ~skip~0 := 0; {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 118: Hoare triple {258556#false} assume !false; {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 119: Hoare triple {258556#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 120: Hoare triple {258556#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 121: Hoare triple {258556#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 122: Hoare triple {258556#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 123: Hoare triple {258556#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 124: Hoare triple {258556#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 125: Hoare triple {258556#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 126: Hoare triple {258556#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,851 INFO L290 TraceCheckUtils]: 127: Hoare triple {258556#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 128: Hoare triple {258556#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 129: Hoare triple {258556#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 130: Hoare triple {258556#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 131: Hoare triple {258556#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 132: Hoare triple {258556#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 133: Hoare triple {258556#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 134: Hoare triple {258556#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 135: Hoare triple {258556#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 136: Hoare triple {258556#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 137: Hoare triple {258556#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 138: Hoare triple {258556#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 139: Hoare triple {258556#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 140: Hoare triple {258556#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 141: Hoare triple {258556#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,852 INFO L290 TraceCheckUtils]: 142: Hoare triple {258556#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 143: Hoare triple {258556#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 144: Hoare triple {258556#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 145: Hoare triple {258556#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 146: Hoare triple {258556#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 147: Hoare triple {258556#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 148: Hoare triple {258556#false} assume 8640 == #t~mem75;havoc #t~mem75; {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 149: Hoare triple {258556#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 150: Hoare triple {258556#false} assume !(9 == ~blastFlag~0); {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 151: Hoare triple {258556#false} assume 12 == ~blastFlag~0; {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L290 TraceCheckUtils]: 152: Hoare triple {258556#false} assume !false; {258556#false} is VALID [2022-04-08 08:53:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-08 08:53:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:53:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840391883] [2022-04-08 08:53:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840391883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:55,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:55,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:55,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:53:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1944019738] [2022-04-08 08:53:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1944019738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:53:55,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:53:55,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:53:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616901306] [2022-04-08 08:53:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:53:55,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-08 08:53:55,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:53:55,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:53:55,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:53:55,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:53:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:53:55,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:53:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:53:55,917 INFO L87 Difference]: Start difference. First operand 1497 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:03,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:10,189 INFO L93 Difference]: Finished difference Result 3158 states and 4714 transitions. [2022-04-08 08:54:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:54:10,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-08 08:54:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:54:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:54:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 08:54:10,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 08:54:10,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:10,674 INFO L225 Difference]: With dead ends: 3158 [2022-04-08 08:54:10,674 INFO L226 Difference]: Without dead ends: 1687 [2022-04-08 08:54:10,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:54:10,677 INFO L913 BasicCegarLoop]: 154 mSDtfsCounter, 128 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:54:10,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 422 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 08:54:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-04-08 08:54:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1497. [2022-04-08 08:54:10,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:54:10,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1687 states. Second operand has 1497 states, 1492 states have (on average 1.4839142091152815) internal successors, (2214), 1492 states have internal predecessors, (2214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:10,846 INFO L74 IsIncluded]: Start isIncluded. First operand 1687 states. Second operand has 1497 states, 1492 states have (on average 1.4839142091152815) internal successors, (2214), 1492 states have internal predecessors, (2214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:10,847 INFO L87 Difference]: Start difference. First operand 1687 states. Second operand has 1497 states, 1492 states have (on average 1.4839142091152815) internal successors, (2214), 1492 states have internal predecessors, (2214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:10,918 INFO L93 Difference]: Finished difference Result 1687 states and 2473 transitions. [2022-04-08 08:54:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2473 transitions. [2022-04-08 08:54:10,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:10,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:10,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 1497 states, 1492 states have (on average 1.4839142091152815) internal successors, (2214), 1492 states have internal predecessors, (2214), 3 states have call successors, (3), 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 1687 states. [2022-04-08 08:54:10,921 INFO L87 Difference]: Start difference. First operand has 1497 states, 1492 states have (on average 1.4839142091152815) internal successors, (2214), 1492 states have internal predecessors, (2214), 3 states have call successors, (3), 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 1687 states. [2022-04-08 08:54:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:10,993 INFO L93 Difference]: Finished difference Result 1687 states and 2473 transitions. [2022-04-08 08:54:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2473 transitions. [2022-04-08 08:54:10,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:10,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:10,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:54:10,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:54:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1492 states have (on average 1.4839142091152815) internal successors, (2214), 1492 states have internal predecessors, (2214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2218 transitions. [2022-04-08 08:54:11,087 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2218 transitions. Word has length 153 [2022-04-08 08:54:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:54:11,088 INFO L478 AbstractCegarLoop]: Abstraction has 1497 states and 2218 transitions. [2022-04-08 08:54:11,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:11,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1497 states and 2218 transitions. [2022-04-08 08:54:16,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2218 edges. 2217 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2218 transitions. [2022-04-08 08:54:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 08:54:16,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:16,328 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-04-08 08:54:16,328 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-08 08:54:16,328 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1383268911, now seen corresponding path program 1 times [2022-04-08 08:54:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:16,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270530971] [2022-04-08 08:54:16,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:16,412 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:16,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1383268911, now seen corresponding path program 2 times [2022-04-08 08:54:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:16,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134634645] [2022-04-08 08:54:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:16,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {271258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {271251#true} is VALID [2022-04-08 08:54:16,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {271251#true} assume true; {271251#true} is VALID [2022-04-08 08:54:16,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {271251#true} {271251#true} #710#return; {271251#true} is VALID [2022-04-08 08:54:16,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {271251#true} call ULTIMATE.init(); {271258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:16,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {271258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {271251#true} assume true; {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271251#true} {271251#true} #710#return; {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {271251#true} call #t~ret161 := main(); {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {271251#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {271251#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L272 TraceCheckUtils]: 7: Hoare triple {271251#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {271251#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {271251#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {271251#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {271251#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {271251#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {271251#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {271251#true} assume !false; {271251#true} is VALID [2022-04-08 08:54:16,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {271251#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {271251#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {271251#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {271251#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {271251#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {271251#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {271251#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {271251#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {271251#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {271251#true} assume 8464 == #t~mem55;havoc #t~mem55; {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {271251#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {271251#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {271251#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {271251#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {271251#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {271251#true} ~skip~0 := 0; {271251#true} is VALID [2022-04-08 08:54:16,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {271251#true} assume !false; {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {271251#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {271251#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {271251#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {271251#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {271251#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {271251#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {271251#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {271251#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {271251#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {271251#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {271251#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {271251#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {271251#true} assume 8496 == #t~mem58;havoc #t~mem58; {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {271251#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {271251#true} is VALID [2022-04-08 08:54:16,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {271251#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {271251#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {271251#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {271251#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {271251#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {271251#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {271251#true} ~skip~0 := 0; {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {271251#true} assume !false; {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {271251#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {271251#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {271251#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {271251#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {271251#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {271251#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {271251#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {271251#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 62: Hoare triple {271251#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {271251#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {271251#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {271251#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {271251#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 67: Hoare triple {271251#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 68: Hoare triple {271251#true} assume 8512 == #t~mem60;havoc #t~mem60; {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 69: Hoare triple {271251#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {271251#true} is VALID [2022-04-08 08:54:16,608 INFO L290 TraceCheckUtils]: 70: Hoare triple {271251#true} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {271251#true} is VALID [2022-04-08 08:54:16,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {271251#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,618 INFO L290 TraceCheckUtils]: 72: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,619 INFO L290 TraceCheckUtils]: 73: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,619 INFO L290 TraceCheckUtils]: 74: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,619 INFO L290 TraceCheckUtils]: 75: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,620 INFO L290 TraceCheckUtils]: 76: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,620 INFO L290 TraceCheckUtils]: 77: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,620 INFO L290 TraceCheckUtils]: 78: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,621 INFO L290 TraceCheckUtils]: 79: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,621 INFO L290 TraceCheckUtils]: 80: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,621 INFO L290 TraceCheckUtils]: 81: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 82: Hoare triple {271256#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {271257#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 83: Hoare triple {271257#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {271252#false} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 84: Hoare triple {271252#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {271252#false} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 85: Hoare triple {271252#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 86: Hoare triple {271252#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 87: Hoare triple {271252#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {271252#false} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 88: Hoare triple {271252#false} ~skip~0 := 0; {271252#false} is VALID [2022-04-08 08:54:16,622 INFO L290 TraceCheckUtils]: 89: Hoare triple {271252#false} assume !false; {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 90: Hoare triple {271252#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 91: Hoare triple {271252#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 92: Hoare triple {271252#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 93: Hoare triple {271252#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 94: Hoare triple {271252#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 95: Hoare triple {271252#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 96: Hoare triple {271252#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 97: Hoare triple {271252#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 98: Hoare triple {271252#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 99: Hoare triple {271252#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 100: Hoare triple {271252#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 101: Hoare triple {271252#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 102: Hoare triple {271252#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,623 INFO L290 TraceCheckUtils]: 103: Hoare triple {271252#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 104: Hoare triple {271252#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 105: Hoare triple {271252#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 106: Hoare triple {271252#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 107: Hoare triple {271252#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 108: Hoare triple {271252#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 109: Hoare triple {271252#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 110: Hoare triple {271252#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 111: Hoare triple {271252#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 112: Hoare triple {271252#false} assume 8448 == #t~mem68;havoc #t~mem68; {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 113: Hoare triple {271252#false} assume !(~num1~0 > 0); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 114: Hoare triple {271252#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 115: Hoare triple {271252#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 116: Hoare triple {271252#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 117: Hoare triple {271252#false} ~skip~0 := 0; {271252#false} is VALID [2022-04-08 08:54:16,624 INFO L290 TraceCheckUtils]: 118: Hoare triple {271252#false} assume !false; {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 119: Hoare triple {271252#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 120: Hoare triple {271252#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 121: Hoare triple {271252#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 122: Hoare triple {271252#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 123: Hoare triple {271252#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 124: Hoare triple {271252#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 125: Hoare triple {271252#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 126: Hoare triple {271252#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 127: Hoare triple {271252#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 128: Hoare triple {271252#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 129: Hoare triple {271252#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 130: Hoare triple {271252#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 131: Hoare triple {271252#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 132: Hoare triple {271252#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,625 INFO L290 TraceCheckUtils]: 133: Hoare triple {271252#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 134: Hoare triple {271252#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 135: Hoare triple {271252#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 136: Hoare triple {271252#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 137: Hoare triple {271252#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 138: Hoare triple {271252#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 139: Hoare triple {271252#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 140: Hoare triple {271252#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 141: Hoare triple {271252#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 142: Hoare triple {271252#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 143: Hoare triple {271252#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 144: Hoare triple {271252#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 145: Hoare triple {271252#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 146: Hoare triple {271252#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 147: Hoare triple {271252#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {271252#false} is VALID [2022-04-08 08:54:16,626 INFO L290 TraceCheckUtils]: 148: Hoare triple {271252#false} assume 8640 == #t~mem75;havoc #t~mem75; {271252#false} is VALID [2022-04-08 08:54:16,627 INFO L290 TraceCheckUtils]: 149: Hoare triple {271252#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {271252#false} is VALID [2022-04-08 08:54:16,627 INFO L290 TraceCheckUtils]: 150: Hoare triple {271252#false} assume !(9 == ~blastFlag~0); {271252#false} is VALID [2022-04-08 08:54:16,627 INFO L290 TraceCheckUtils]: 151: Hoare triple {271252#false} assume 12 == ~blastFlag~0; {271252#false} is VALID [2022-04-08 08:54:16,627 INFO L290 TraceCheckUtils]: 152: Hoare triple {271252#false} assume !false; {271252#false} is VALID [2022-04-08 08:54:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 08:54:16,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134634645] [2022-04-08 08:54:16,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134634645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:16,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:16,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:16,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:16,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [270530971] [2022-04-08 08:54:16,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [270530971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:16,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:16,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79858603] [2022-04-08 08:54:16,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 153 [2022-04-08 08:54:16,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:16,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:16,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:16,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:54:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:54:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:54:16,700 INFO L87 Difference]: Start difference. First operand 1497 states and 2218 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:19,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:21,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:26,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:30,253 INFO L93 Difference]: Finished difference Result 2081 states and 3085 transitions. [2022-04-08 08:54:30,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:54:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 153 [2022-04-08 08:54:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:54:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:54:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 08:54:30,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-08 08:54:30,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:30,651 INFO L225 Difference]: With dead ends: 2081 [2022-04-08 08:54:30,651 INFO L226 Difference]: Without dead ends: 610 [2022-04-08 08:54:30,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:54:30,652 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:54:30,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 386 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-08 08:54:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-04-08 08:54:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2022-04-08 08:54:30,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:54:30,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 610 states. Second operand has 544 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 539 states have internal predecessors, (790), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:30,699 INFO L74 IsIncluded]: Start isIncluded. First operand 610 states. Second operand has 544 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 539 states have internal predecessors, (790), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:30,700 INFO L87 Difference]: Start difference. First operand 610 states. Second operand has 544 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 539 states have internal predecessors, (790), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:30,711 INFO L93 Difference]: Finished difference Result 610 states and 889 transitions. [2022-04-08 08:54:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 889 transitions. [2022-04-08 08:54:30,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:30,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:30,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 544 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 539 states have internal predecessors, (790), 3 states have call successors, (3), 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 610 states. [2022-04-08 08:54:30,712 INFO L87 Difference]: Start difference. First operand has 544 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 539 states have internal predecessors, (790), 3 states have call successors, (3), 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 610 states. [2022-04-08 08:54:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:30,722 INFO L93 Difference]: Finished difference Result 610 states and 889 transitions. [2022-04-08 08:54:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 889 transitions. [2022-04-08 08:54:30,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:30,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:30,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:54:30,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:54:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 539 states have internal predecessors, (790), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 794 transitions. [2022-04-08 08:54:30,734 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 794 transitions. Word has length 153 [2022-04-08 08:54:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:54:30,735 INFO L478 AbstractCegarLoop]: Abstraction has 544 states and 794 transitions. [2022-04-08 08:54:30,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:30,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 544 states and 794 transitions. [2022-04-08 08:54:31,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 794 edges. 794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 794 transitions. [2022-04-08 08:54:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 08:54:31,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:31,594 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:54:31,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-08 08:54:31,594 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 884708127, now seen corresponding path program 1 times [2022-04-08 08:54:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:31,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244915402] [2022-04-08 08:54:31,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:31,678 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:31,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash 884708127, now seen corresponding path program 2 times [2022-04-08 08:54:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:31,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402353603] [2022-04-08 08:54:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:31,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {277740#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {277733#true} is VALID [2022-04-08 08:54:31,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {277733#true} assume true; {277733#true} is VALID [2022-04-08 08:54:31,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {277733#true} {277733#true} #710#return; {277733#true} is VALID [2022-04-08 08:54:31,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {277733#true} call ULTIMATE.init(); {277740#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:31,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {277740#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {277733#true} is VALID [2022-04-08 08:54:31,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {277733#true} assume true; {277733#true} is VALID [2022-04-08 08:54:31,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277733#true} {277733#true} #710#return; {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {277733#true} call #t~ret161 := main(); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {277733#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {277733#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L272 TraceCheckUtils]: 7: Hoare triple {277733#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {277733#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {277733#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {277733#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {277733#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {277733#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {277733#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {277733#true} assume !false; {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {277733#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {277733#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {277733#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {277733#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {277733#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {277733#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {277733#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {277733#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {277733#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {277733#true} assume 8464 == #t~mem55;havoc #t~mem55; {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {277733#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {277733#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {277733#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {277733#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {277733#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {277733#true} ~skip~0 := 0; {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {277733#true} assume !false; {277733#true} is VALID [2022-04-08 08:54:31,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {277733#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {277733#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {277733#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {277733#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {277733#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {277733#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {277733#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {277733#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {277733#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {277733#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {277733#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {277733#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {277733#true} assume 8496 == #t~mem58;havoc #t~mem58; {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {277733#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {277733#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {277733#true} is VALID [2022-04-08 08:54:31,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {277733#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {277733#true} is VALID [2022-04-08 08:54:31,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {277733#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,843 INFO L290 TraceCheckUtils]: 66: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,843 INFO L290 TraceCheckUtils]: 67: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,844 INFO L290 TraceCheckUtils]: 71: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,845 INFO L290 TraceCheckUtils]: 72: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,847 INFO L290 TraceCheckUtils]: 77: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:54:31,847 INFO L290 TraceCheckUtils]: 78: Hoare triple {277738#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {277739#(not (= |ssl3_accept_#t~mem71| 8592))} is VALID [2022-04-08 08:54:31,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {277739#(not (= |ssl3_accept_#t~mem71| 8592))} assume 8592 == #t~mem71;havoc #t~mem71; {277734#false} is VALID [2022-04-08 08:54:31,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {277734#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {277734#false} is VALID [2022-04-08 08:54:31,847 INFO L290 TraceCheckUtils]: 81: Hoare triple {277734#false} assume !(7 == ~blastFlag~0); {277734#false} is VALID [2022-04-08 08:54:31,847 INFO L290 TraceCheckUtils]: 82: Hoare triple {277734#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 83: Hoare triple {277734#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 84: Hoare triple {277734#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {277734#false} ~skip~0 := 0; {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {277734#false} assume !false; {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {277734#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {277734#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {277734#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 90: Hoare triple {277734#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 91: Hoare triple {277734#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {277734#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {277734#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 94: Hoare triple {277734#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 95: Hoare triple {277734#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 96: Hoare triple {277734#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,848 INFO L290 TraceCheckUtils]: 97: Hoare triple {277734#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 98: Hoare triple {277734#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 99: Hoare triple {277734#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 100: Hoare triple {277734#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 101: Hoare triple {277734#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 102: Hoare triple {277734#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 103: Hoare triple {277734#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 104: Hoare triple {277734#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 105: Hoare triple {277734#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 106: Hoare triple {277734#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 107: Hoare triple {277734#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {277734#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 109: Hoare triple {277734#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {277734#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 111: Hoare triple {277734#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,849 INFO L290 TraceCheckUtils]: 112: Hoare triple {277734#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 113: Hoare triple {277734#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 114: Hoare triple {277734#false} assume 8608 == #t~mem73;havoc #t~mem73; {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 115: Hoare triple {277734#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 116: Hoare triple {277734#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 117: Hoare triple {277734#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 118: Hoare triple {277734#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 119: Hoare triple {277734#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 120: Hoare triple {277734#false} ~skip~0 := 0; {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 121: Hoare triple {277734#false} assume !false; {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 122: Hoare triple {277734#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 123: Hoare triple {277734#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 124: Hoare triple {277734#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 125: Hoare triple {277734#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 126: Hoare triple {277734#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,850 INFO L290 TraceCheckUtils]: 127: Hoare triple {277734#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 128: Hoare triple {277734#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 129: Hoare triple {277734#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 130: Hoare triple {277734#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 131: Hoare triple {277734#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 132: Hoare triple {277734#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 133: Hoare triple {277734#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 134: Hoare triple {277734#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 135: Hoare triple {277734#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 136: Hoare triple {277734#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 137: Hoare triple {277734#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 138: Hoare triple {277734#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 139: Hoare triple {277734#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 140: Hoare triple {277734#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,851 INFO L290 TraceCheckUtils]: 141: Hoare triple {277734#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 142: Hoare triple {277734#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 143: Hoare triple {277734#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 144: Hoare triple {277734#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 145: Hoare triple {277734#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 146: Hoare triple {277734#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 147: Hoare triple {277734#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 148: Hoare triple {277734#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 149: Hoare triple {277734#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 150: Hoare triple {277734#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 151: Hoare triple {277734#false} assume 8640 == #t~mem75;havoc #t~mem75; {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 152: Hoare triple {277734#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 153: Hoare triple {277734#false} assume !(9 == ~blastFlag~0); {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 154: Hoare triple {277734#false} assume 12 == ~blastFlag~0; {277734#false} is VALID [2022-04-08 08:54:31,852 INFO L290 TraceCheckUtils]: 155: Hoare triple {277734#false} assume !false; {277734#false} is VALID [2022-04-08 08:54:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-08 08:54:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:31,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402353603] [2022-04-08 08:54:31,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402353603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:31,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:31,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:31,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:31,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244915402] [2022-04-08 08:54:31,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244915402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:31,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:31,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992971201] [2022-04-08 08:54:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 156 [2022-04-08 08:54:31,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:31,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:31,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:31,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:54:31,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:54:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:54:31,953 INFO L87 Difference]: Start difference. First operand 544 states and 794 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:34,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:36,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:38,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:43,420 INFO L93 Difference]: Finished difference Result 1168 states and 1712 transitions. [2022-04-08 08:54:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:54:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 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 156 [2022-04-08 08:54:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:54:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:54:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:54:43,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-08 08:54:43,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:43,842 INFO L225 Difference]: With dead ends: 1168 [2022-04-08 08:54:43,842 INFO L226 Difference]: Without dead ends: 652 [2022-04-08 08:54:43,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:54:43,843 INFO L913 BasicCegarLoop]: 136 mSDtfsCounter, 116 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-08 08:54:43,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 386 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-08 08:54:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-04-08 08:54:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 579. [2022-04-08 08:54:43,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:54:43,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 652 states. Second operand has 579 states, 574 states have (on average 1.4599303135888502) internal successors, (838), 574 states have internal predecessors, (838), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:43,885 INFO L74 IsIncluded]: Start isIncluded. First operand 652 states. Second operand has 579 states, 574 states have (on average 1.4599303135888502) internal successors, (838), 574 states have internal predecessors, (838), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:43,885 INFO L87 Difference]: Start difference. First operand 652 states. Second operand has 579 states, 574 states have (on average 1.4599303135888502) internal successors, (838), 574 states have internal predecessors, (838), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:43,896 INFO L93 Difference]: Finished difference Result 652 states and 946 transitions. [2022-04-08 08:54:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 946 transitions. [2022-04-08 08:54:43,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:43,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:43,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 579 states, 574 states have (on average 1.4599303135888502) internal successors, (838), 574 states have internal predecessors, (838), 3 states have call successors, (3), 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 652 states. [2022-04-08 08:54:43,898 INFO L87 Difference]: Start difference. First operand has 579 states, 574 states have (on average 1.4599303135888502) internal successors, (838), 574 states have internal predecessors, (838), 3 states have call successors, (3), 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 652 states. [2022-04-08 08:54:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:43,909 INFO L93 Difference]: Finished difference Result 652 states and 946 transitions. [2022-04-08 08:54:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 946 transitions. [2022-04-08 08:54:43,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:43,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:43,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:54:43,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:54:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 574 states have (on average 1.4599303135888502) internal successors, (838), 574 states have internal predecessors, (838), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 842 transitions. [2022-04-08 08:54:43,922 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 842 transitions. Word has length 156 [2022-04-08 08:54:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:54:43,922 INFO L478 AbstractCegarLoop]: Abstraction has 579 states and 842 transitions. [2022-04-08 08:54:43,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:43,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 579 states and 842 transitions. [2022-04-08 08:54:44,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 842 edges. 842 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 842 transitions. [2022-04-08 08:54:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-08 08:54:44,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:44,875 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 08:54:44,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-08 08:54:44,875 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 494041087, now seen corresponding path program 1 times [2022-04-08 08:54:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:44,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560023038] [2022-04-08 08:54:44,951 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:44,951 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:44,951 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:44,951 INFO L85 PathProgramCache]: Analyzing trace with hash 494041087, now seen corresponding path program 2 times [2022-04-08 08:54:44,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:44,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126827960] [2022-04-08 08:54:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:45,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {282550#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {282543#true} is VALID [2022-04-08 08:54:45,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {282543#true} assume true; {282543#true} is VALID [2022-04-08 08:54:45,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {282543#true} {282543#true} #710#return; {282543#true} is VALID [2022-04-08 08:54:45,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {282543#true} call ULTIMATE.init(); {282550#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:45,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {282550#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {282543#true} assume true; {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282543#true} {282543#true} #710#return; {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {282543#true} call #t~ret161 := main(); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {282543#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {282543#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L272 TraceCheckUtils]: 7: Hoare triple {282543#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {282543#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {282543#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {282543#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {282543#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {282543#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {282543#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {282543#true} assume !false; {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {282543#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {282543#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {282543#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {282543#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {282543#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {282543#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {282543#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {282543#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {282543#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {282543#true} assume 8464 == #t~mem55;havoc #t~mem55; {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {282543#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {282543#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {282543#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {282543#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {282543#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {282543#true} ~skip~0 := 0; {282543#true} is VALID [2022-04-08 08:54:45,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {282543#true} assume !false; {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {282543#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {282543#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {282543#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {282543#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {282543#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {282543#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {282543#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {282543#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {282543#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {282543#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {282543#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {282543#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {282543#true} assume 8496 == #t~mem58;havoc #t~mem58; {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {282543#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {282543#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {282543#true} is VALID [2022-04-08 08:54:45,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {282543#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {282543#true} is VALID [2022-04-08 08:54:45,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {282543#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,162 INFO L290 TraceCheckUtils]: 73: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,162 INFO L290 TraceCheckUtils]: 74: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,162 INFO L290 TraceCheckUtils]: 75: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:54:45,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {282548#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {282549#(= |ssl3_accept_#t~mem72| 8656)} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {282549#(= |ssl3_accept_#t~mem72| 8656)} assume 8593 == #t~mem72;havoc #t~mem72; {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {282544#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {282544#false} assume !(7 == ~blastFlag~0); {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {282544#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {282544#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {282544#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {282544#false} ~skip~0 := 0; {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 87: Hoare triple {282544#false} assume !false; {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {282544#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 89: Hoare triple {282544#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 90: Hoare triple {282544#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,164 INFO L290 TraceCheckUtils]: 91: Hoare triple {282544#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 92: Hoare triple {282544#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 93: Hoare triple {282544#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {282544#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {282544#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 96: Hoare triple {282544#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {282544#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 98: Hoare triple {282544#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 99: Hoare triple {282544#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 100: Hoare triple {282544#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 101: Hoare triple {282544#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 102: Hoare triple {282544#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 103: Hoare triple {282544#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 104: Hoare triple {282544#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {282544#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,165 INFO L290 TraceCheckUtils]: 106: Hoare triple {282544#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 107: Hoare triple {282544#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 108: Hoare triple {282544#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 109: Hoare triple {282544#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 110: Hoare triple {282544#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 111: Hoare triple {282544#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 112: Hoare triple {282544#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 113: Hoare triple {282544#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 114: Hoare triple {282544#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 115: Hoare triple {282544#false} assume 8608 == #t~mem73;havoc #t~mem73; {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 116: Hoare triple {282544#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 117: Hoare triple {282544#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 118: Hoare triple {282544#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 119: Hoare triple {282544#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 120: Hoare triple {282544#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 121: Hoare triple {282544#false} ~skip~0 := 0; {282544#false} is VALID [2022-04-08 08:54:45,166 INFO L290 TraceCheckUtils]: 122: Hoare triple {282544#false} assume !false; {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 123: Hoare triple {282544#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 124: Hoare triple {282544#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 125: Hoare triple {282544#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 126: Hoare triple {282544#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 127: Hoare triple {282544#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 128: Hoare triple {282544#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 129: Hoare triple {282544#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 130: Hoare triple {282544#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 131: Hoare triple {282544#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 132: Hoare triple {282544#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 133: Hoare triple {282544#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 134: Hoare triple {282544#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 135: Hoare triple {282544#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,167 INFO L290 TraceCheckUtils]: 136: Hoare triple {282544#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 137: Hoare triple {282544#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 138: Hoare triple {282544#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 139: Hoare triple {282544#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 140: Hoare triple {282544#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 141: Hoare triple {282544#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 142: Hoare triple {282544#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 143: Hoare triple {282544#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 144: Hoare triple {282544#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 145: Hoare triple {282544#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 146: Hoare triple {282544#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 147: Hoare triple {282544#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 148: Hoare triple {282544#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 149: Hoare triple {282544#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 150: Hoare triple {282544#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 151: Hoare triple {282544#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {282544#false} is VALID [2022-04-08 08:54:45,168 INFO L290 TraceCheckUtils]: 152: Hoare triple {282544#false} assume 8640 == #t~mem75;havoc #t~mem75; {282544#false} is VALID [2022-04-08 08:54:45,169 INFO L290 TraceCheckUtils]: 153: Hoare triple {282544#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {282544#false} is VALID [2022-04-08 08:54:45,169 INFO L290 TraceCheckUtils]: 154: Hoare triple {282544#false} assume !(9 == ~blastFlag~0); {282544#false} is VALID [2022-04-08 08:54:45,169 INFO L290 TraceCheckUtils]: 155: Hoare triple {282544#false} assume 12 == ~blastFlag~0; {282544#false} is VALID [2022-04-08 08:54:45,169 INFO L290 TraceCheckUtils]: 156: Hoare triple {282544#false} assume !false; {282544#false} is VALID [2022-04-08 08:54:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-08 08:54:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:45,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126827960] [2022-04-08 08:54:45,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126827960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:45,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:45,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:45,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:45,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560023038] [2022-04-08 08:54:45,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560023038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:45,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:45,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:54:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888535708] [2022-04-08 08:54:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 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 157 [2022-04-08 08:54:45,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:45,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:45,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:45,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:54:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:54:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:54:45,240 INFO L87 Difference]: Start difference. First operand 579 states and 842 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:47,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:54:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:51,135 INFO L93 Difference]: Finished difference Result 1164 states and 1699 transitions. [2022-04-08 08:54:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:54:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 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 157 [2022-04-08 08:54:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:54:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-08 08:54:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-08 08:54:51,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 514 transitions. [2022-04-08 08:54:51,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:51,442 INFO L225 Difference]: With dead ends: 1164 [2022-04-08 08:54:51,442 INFO L226 Difference]: Without dead ends: 613 [2022-04-08 08:54:51,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:54:51,446 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 47 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:54:51,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 551 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 08:54:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-04-08 08:54:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 586. [2022-04-08 08:54:51,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:54:51,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 586 states, 581 states have (on average 1.4578313253012047) internal successors, (847), 581 states have internal predecessors, (847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:51,507 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 586 states, 581 states have (on average 1.4578313253012047) internal successors, (847), 581 states have internal predecessors, (847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:51,507 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 586 states, 581 states have (on average 1.4578313253012047) internal successors, (847), 581 states have internal predecessors, (847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:51,517 INFO L93 Difference]: Finished difference Result 613 states and 888 transitions. [2022-04-08 08:54:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 888 transitions. [2022-04-08 08:54:51,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:51,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:51,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 586 states, 581 states have (on average 1.4578313253012047) internal successors, (847), 581 states have internal predecessors, (847), 3 states have call successors, (3), 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 613 states. [2022-04-08 08:54:51,519 INFO L87 Difference]: Start difference. First operand has 586 states, 581 states have (on average 1.4578313253012047) internal successors, (847), 581 states have internal predecessors, (847), 3 states have call successors, (3), 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 613 states. [2022-04-08 08:54:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:54:51,529 INFO L93 Difference]: Finished difference Result 613 states and 888 transitions. [2022-04-08 08:54:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 888 transitions. [2022-04-08 08:54:51,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:54:51,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:54:51,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:54:51,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:54:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 581 states have (on average 1.4578313253012047) internal successors, (847), 581 states have internal predecessors, (847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 851 transitions. [2022-04-08 08:54:51,542 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 851 transitions. Word has length 157 [2022-04-08 08:54:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:54:51,542 INFO L478 AbstractCegarLoop]: Abstraction has 586 states and 851 transitions. [2022-04-08 08:54:51,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:51,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 586 states and 851 transitions. [2022-04-08 08:54:52,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 851 edges. 851 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 851 transitions. [2022-04-08 08:54:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 08:54:52,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:54:52,475 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-08 08:54:52,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-08 08:54:52,475 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:54:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:54:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1634356601, now seen corresponding path program 1 times [2022-04-08 08:54:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:52,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448671740] [2022-04-08 08:54:52,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:54:52,582 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:54:52,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:54:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1634356601, now seen corresponding path program 2 times [2022-04-08 08:54:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:54:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50068017] [2022-04-08 08:54:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:54:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:54:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:54:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:54:52,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {287287#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {287281#true} is VALID [2022-04-08 08:54:52,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {287281#true} assume true; {287281#true} is VALID [2022-04-08 08:54:52,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {287281#true} {287281#true} #710#return; {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {287281#true} call ULTIMATE.init(); {287287#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {287287#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {287281#true} assume true; {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287281#true} {287281#true} #710#return; {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {287281#true} call #t~ret161 := main(); {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {287281#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {287281#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L272 TraceCheckUtils]: 7: Hoare triple {287281#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {287281#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {287281#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {287281#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {287281#true} is VALID [2022-04-08 08:54:52,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {287281#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {287281#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {287281#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {287281#true} assume !false; {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {287281#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {287281#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {287281#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {287281#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {287281#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {287281#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {287281#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {287281#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {287281#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {287281#true} assume 8464 == #t~mem55;havoc #t~mem55; {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {287281#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {287281#true} is VALID [2022-04-08 08:54:52,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {287281#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {287281#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {287281#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {287281#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {287281#true} ~skip~0 := 0; {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {287281#true} assume !false; {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {287281#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {287281#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {287281#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {287281#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {287281#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {287281#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {287281#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {287281#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {287281#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {287281#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {287281#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {287281#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {287281#true} is VALID [2022-04-08 08:54:52,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {287281#true} assume 8496 == #t~mem58;havoc #t~mem58; {287281#true} is VALID [2022-04-08 08:54:52,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {287281#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {287281#true} is VALID [2022-04-08 08:54:52,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {287281#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,736 INFO L290 TraceCheckUtils]: 60: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,736 INFO L290 TraceCheckUtils]: 61: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,738 INFO L290 TraceCheckUtils]: 69: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,739 INFO L290 TraceCheckUtils]: 72: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,739 INFO L290 TraceCheckUtils]: 73: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,739 INFO L290 TraceCheckUtils]: 74: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,740 INFO L290 TraceCheckUtils]: 76: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,740 INFO L290 TraceCheckUtils]: 77: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,740 INFO L290 TraceCheckUtils]: 78: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,741 INFO L290 TraceCheckUtils]: 79: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,741 INFO L290 TraceCheckUtils]: 80: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,742 INFO L290 TraceCheckUtils]: 85: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,743 INFO L290 TraceCheckUtils]: 87: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,743 INFO L290 TraceCheckUtils]: 88: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,743 INFO L290 TraceCheckUtils]: 89: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,744 INFO L290 TraceCheckUtils]: 90: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,744 INFO L290 TraceCheckUtils]: 91: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,744 INFO L290 TraceCheckUtils]: 92: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,744 INFO L290 TraceCheckUtils]: 93: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,745 INFO L290 TraceCheckUtils]: 94: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,745 INFO L290 TraceCheckUtils]: 95: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume 8545 == #t~mem65;havoc #t~mem65; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,745 INFO L290 TraceCheckUtils]: 96: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,746 INFO L290 TraceCheckUtils]: 97: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,746 INFO L290 TraceCheckUtils]: 99: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 101: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {287286#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 102: Hoare triple {287286#(= 2 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 103: Hoare triple {287282#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 104: Hoare triple {287282#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 105: Hoare triple {287282#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 106: Hoare triple {287282#false} ~skip~0 := 0; {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 107: Hoare triple {287282#false} assume !false; {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 108: Hoare triple {287282#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 109: Hoare triple {287282#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,747 INFO L290 TraceCheckUtils]: 110: Hoare triple {287282#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 111: Hoare triple {287282#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 112: Hoare triple {287282#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 113: Hoare triple {287282#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 114: Hoare triple {287282#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 115: Hoare triple {287282#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 116: Hoare triple {287282#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 117: Hoare triple {287282#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 118: Hoare triple {287282#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 119: Hoare triple {287282#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 120: Hoare triple {287282#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 121: Hoare triple {287282#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 122: Hoare triple {287282#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 123: Hoare triple {287282#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 124: Hoare triple {287282#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,748 INFO L290 TraceCheckUtils]: 125: Hoare triple {287282#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 126: Hoare triple {287282#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 127: Hoare triple {287282#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 128: Hoare triple {287282#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 129: Hoare triple {287282#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 130: Hoare triple {287282#false} assume 8448 == #t~mem68;havoc #t~mem68; {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 131: Hoare triple {287282#false} assume !(~num1~0 > 0); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 132: Hoare triple {287282#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 133: Hoare triple {287282#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 134: Hoare triple {287282#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 135: Hoare triple {287282#false} ~skip~0 := 0; {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 136: Hoare triple {287282#false} assume !false; {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 137: Hoare triple {287282#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 138: Hoare triple {287282#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 139: Hoare triple {287282#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,749 INFO L290 TraceCheckUtils]: 140: Hoare triple {287282#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 141: Hoare triple {287282#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 142: Hoare triple {287282#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 143: Hoare triple {287282#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 144: Hoare triple {287282#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 145: Hoare triple {287282#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 146: Hoare triple {287282#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 147: Hoare triple {287282#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 148: Hoare triple {287282#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 149: Hoare triple {287282#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 150: Hoare triple {287282#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 151: Hoare triple {287282#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 152: Hoare triple {287282#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 153: Hoare triple {287282#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 154: Hoare triple {287282#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,750 INFO L290 TraceCheckUtils]: 155: Hoare triple {287282#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 156: Hoare triple {287282#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 157: Hoare triple {287282#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 158: Hoare triple {287282#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 159: Hoare triple {287282#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 160: Hoare triple {287282#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 161: Hoare triple {287282#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 162: Hoare triple {287282#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 163: Hoare triple {287282#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 164: Hoare triple {287282#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 165: Hoare triple {287282#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 166: Hoare triple {287282#false} assume 8640 == #t~mem75;havoc #t~mem75; {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 167: Hoare triple {287282#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 168: Hoare triple {287282#false} assume !(9 == ~blastFlag~0); {287282#false} is VALID [2022-04-08 08:54:52,751 INFO L290 TraceCheckUtils]: 169: Hoare triple {287282#false} assume 12 == ~blastFlag~0; {287282#false} is VALID [2022-04-08 08:54:52,752 INFO L290 TraceCheckUtils]: 170: Hoare triple {287282#false} assume !false; {287282#false} is VALID [2022-04-08 08:54:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-08 08:54:52,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:54:52,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50068017] [2022-04-08 08:54:52,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50068017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:52,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:52,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:54:52,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:54:52,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448671740] [2022-04-08 08:54:52,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448671740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:54:52,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:54:52,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:54:52,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216749753] [2022-04-08 08:54:52,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:54:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 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 171 [2022-04-08 08:54:52,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:54:52,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:52,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:54:52,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:54:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:54:52,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:54:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:54:52,864 INFO L87 Difference]: Start difference. First operand 586 states and 851 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:54:55,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:03,537 INFO L93 Difference]: Finished difference Result 1699 states and 2487 transitions. [2022-04-08 08:55:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:55:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 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 171 [2022-04-08 08:55:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2022-04-08 08:55:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2022-04-08 08:55:03,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 623 transitions. [2022-04-08 08:55:03,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:04,039 INFO L225 Difference]: With dead ends: 1699 [2022-04-08 08:55:04,039 INFO L226 Difference]: Without dead ends: 1141 [2022-04-08 08:55:04,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:55:04,040 INFO L913 BasicCegarLoop]: 244 mSDtfsCounter, 149 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:04,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 438 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 08:55:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-04-08 08:55:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2022-04-08 08:55:04,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:04,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1141 states. Second operand has 1141 states, 1136 states have (on average 1.4533450704225352) internal successors, (1651), 1136 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:04,223 INFO L74 IsIncluded]: Start isIncluded. First operand 1141 states. Second operand has 1141 states, 1136 states have (on average 1.4533450704225352) internal successors, (1651), 1136 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:04,223 INFO L87 Difference]: Start difference. First operand 1141 states. Second operand has 1141 states, 1136 states have (on average 1.4533450704225352) internal successors, (1651), 1136 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:04,262 INFO L93 Difference]: Finished difference Result 1141 states and 1655 transitions. [2022-04-08 08:55:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1655 transitions. [2022-04-08 08:55:04,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:04,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:04,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 1141 states, 1136 states have (on average 1.4533450704225352) internal successors, (1651), 1136 states have internal predecessors, (1651), 3 states have call successors, (3), 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 1141 states. [2022-04-08 08:55:04,264 INFO L87 Difference]: Start difference. First operand has 1141 states, 1136 states have (on average 1.4533450704225352) internal successors, (1651), 1136 states have internal predecessors, (1651), 3 states have call successors, (3), 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 1141 states. [2022-04-08 08:55:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:04,296 INFO L93 Difference]: Finished difference Result 1141 states and 1655 transitions. [2022-04-08 08:55:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1655 transitions. [2022-04-08 08:55:04,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:04,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:04,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:04,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1136 states have (on average 1.4533450704225352) internal successors, (1651), 1136 states have internal predecessors, (1651), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1655 transitions. [2022-04-08 08:55:04,343 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1655 transitions. Word has length 171 [2022-04-08 08:55:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:04,343 INFO L478 AbstractCegarLoop]: Abstraction has 1141 states and 1655 transitions. [2022-04-08 08:55:04,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:04,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1141 states and 1655 transitions. [2022-04-08 08:55:06,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1655 edges. 1655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1655 transitions. [2022-04-08 08:55:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 08:55:06,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:06,104 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-08 08:55:06,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-08 08:55:06,105 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1954014089, now seen corresponding path program 1 times [2022-04-08 08:55:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:06,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737826717] [2022-04-08 08:55:06,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:06,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:06,181 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1954014089, now seen corresponding path program 2 times [2022-04-08 08:55:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:06,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368385858] [2022-04-08 08:55:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:06,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:06,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {295258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {295252#true} is VALID [2022-04-08 08:55:06,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {295252#true} assume true; {295252#true} is VALID [2022-04-08 08:55:06,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {295252#true} {295252#true} #710#return; {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {295252#true} call ULTIMATE.init(); {295258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {295258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {295252#true} assume true; {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295252#true} {295252#true} #710#return; {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {295252#true} call #t~ret161 := main(); {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {295252#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {295252#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L272 TraceCheckUtils]: 7: Hoare triple {295252#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {295252#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {295252#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {295252#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {295252#true} is VALID [2022-04-08 08:55:06,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {295252#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {295252#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {295252#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {295252#true} assume !false; {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {295252#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {295252#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {295252#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {295252#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {295252#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {295252#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {295252#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {295252#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {295252#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {295252#true} assume 8464 == #t~mem55;havoc #t~mem55; {295252#true} is VALID [2022-04-08 08:55:06,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {295252#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {295252#true} is VALID [2022-04-08 08:55:06,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {295252#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !false; {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {295257#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {295257#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {295253#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {295253#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {295253#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {295253#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {295253#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {295253#false} ~skip~0 := 0; {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {295253#false} assume !false; {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {295253#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {295253#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {295253#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {295253#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {295253#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {295253#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 60: Hoare triple {295253#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {295253#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {295253#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {295253#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {295253#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {295253#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {295253#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {295253#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {295253#false} assume 8512 == #t~mem60;havoc #t~mem60; {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {295253#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {295253#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 71: Hoare triple {295253#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 72: Hoare triple {295253#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {295253#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 74: Hoare triple {295253#false} ~skip~0 := 0; {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {295253#false} assume !false; {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {295253#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {295253#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {295253#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {295253#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {295253#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {295253#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 82: Hoare triple {295253#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 83: Hoare triple {295253#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 84: Hoare triple {295253#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,356 INFO L290 TraceCheckUtils]: 85: Hoare triple {295253#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 86: Hoare triple {295253#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 87: Hoare triple {295253#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 88: Hoare triple {295253#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {295253#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {295253#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {295253#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {295253#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {295253#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {295253#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 95: Hoare triple {295253#false} assume 8545 == #t~mem65;havoc #t~mem65; {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {295253#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {295253#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {295253#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 99: Hoare triple {295253#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,357 INFO L290 TraceCheckUtils]: 100: Hoare triple {295253#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 101: Hoare triple {295253#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 102: Hoare triple {295253#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 103: Hoare triple {295253#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 104: Hoare triple {295253#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 105: Hoare triple {295253#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 106: Hoare triple {295253#false} ~skip~0 := 0; {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 107: Hoare triple {295253#false} assume !false; {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 108: Hoare triple {295253#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 109: Hoare triple {295253#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 110: Hoare triple {295253#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 111: Hoare triple {295253#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 112: Hoare triple {295253#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 113: Hoare triple {295253#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 114: Hoare triple {295253#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,358 INFO L290 TraceCheckUtils]: 115: Hoare triple {295253#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 116: Hoare triple {295253#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 117: Hoare triple {295253#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 118: Hoare triple {295253#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 119: Hoare triple {295253#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 120: Hoare triple {295253#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 121: Hoare triple {295253#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 122: Hoare triple {295253#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 123: Hoare triple {295253#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 124: Hoare triple {295253#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 125: Hoare triple {295253#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 126: Hoare triple {295253#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 127: Hoare triple {295253#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 128: Hoare triple {295253#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 129: Hoare triple {295253#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,359 INFO L290 TraceCheckUtils]: 130: Hoare triple {295253#false} assume 8448 == #t~mem68;havoc #t~mem68; {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 131: Hoare triple {295253#false} assume !(~num1~0 > 0); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 132: Hoare triple {295253#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 133: Hoare triple {295253#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 134: Hoare triple {295253#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 135: Hoare triple {295253#false} ~skip~0 := 0; {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 136: Hoare triple {295253#false} assume !false; {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 137: Hoare triple {295253#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 138: Hoare triple {295253#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 139: Hoare triple {295253#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 140: Hoare triple {295253#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 141: Hoare triple {295253#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 142: Hoare triple {295253#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 143: Hoare triple {295253#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 144: Hoare triple {295253#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,360 INFO L290 TraceCheckUtils]: 145: Hoare triple {295253#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 146: Hoare triple {295253#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 147: Hoare triple {295253#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 148: Hoare triple {295253#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 149: Hoare triple {295253#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 150: Hoare triple {295253#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 151: Hoare triple {295253#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 152: Hoare triple {295253#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 153: Hoare triple {295253#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 154: Hoare triple {295253#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 155: Hoare triple {295253#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 156: Hoare triple {295253#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 157: Hoare triple {295253#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 158: Hoare triple {295253#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 159: Hoare triple {295253#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 160: Hoare triple {295253#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,361 INFO L290 TraceCheckUtils]: 161: Hoare triple {295253#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 162: Hoare triple {295253#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 163: Hoare triple {295253#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 164: Hoare triple {295253#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 165: Hoare triple {295253#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 166: Hoare triple {295253#false} assume 8640 == #t~mem75;havoc #t~mem75; {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 167: Hoare triple {295253#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 168: Hoare triple {295253#false} assume !(9 == ~blastFlag~0); {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 169: Hoare triple {295253#false} assume 12 == ~blastFlag~0; {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L290 TraceCheckUtils]: 170: Hoare triple {295253#false} assume !false; {295253#false} is VALID [2022-04-08 08:55:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-08 08:55:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:06,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368385858] [2022-04-08 08:55:06,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368385858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:06,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:06,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:55:06,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:06,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737826717] [2022-04-08 08:55:06,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737826717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:06,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:06,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:55:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622859362] [2022-04-08 08:55:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:06,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 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 171 [2022-04-08 08:55:06,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:06,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:06,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:06,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:55:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:55:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:55:06,435 INFO L87 Difference]: Start difference. First operand 1141 states and 1655 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:08,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:10,949 INFO L93 Difference]: Finished difference Result 2281 states and 3315 transitions. [2022-04-08 08:55:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:55:10,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 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 171 [2022-04-08 08:55:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2022-04-08 08:55:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2022-04-08 08:55:10,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 460 transitions. [2022-04-08 08:55:11,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:11,309 INFO L225 Difference]: With dead ends: 2281 [2022-04-08 08:55:11,309 INFO L226 Difference]: Without dead ends: 1168 [2022-04-08 08:55:11,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:55:11,310 INFO L913 BasicCegarLoop]: 228 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:11,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 422 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:55:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-04-08 08:55:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1168. [2022-04-08 08:55:11,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:11,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1168 states. Second operand has 1168 states, 1163 states have (on average 1.4496990541702492) internal successors, (1686), 1163 states have internal predecessors, (1686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:11,397 INFO L74 IsIncluded]: Start isIncluded. First operand 1168 states. Second operand has 1168 states, 1163 states have (on average 1.4496990541702492) internal successors, (1686), 1163 states have internal predecessors, (1686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:11,398 INFO L87 Difference]: Start difference. First operand 1168 states. Second operand has 1168 states, 1163 states have (on average 1.4496990541702492) internal successors, (1686), 1163 states have internal predecessors, (1686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:11,431 INFO L93 Difference]: Finished difference Result 1168 states and 1690 transitions. [2022-04-08 08:55:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1690 transitions. [2022-04-08 08:55:11,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:11,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:11,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 1168 states, 1163 states have (on average 1.4496990541702492) internal successors, (1686), 1163 states have internal predecessors, (1686), 3 states have call successors, (3), 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 1168 states. [2022-04-08 08:55:11,432 INFO L87 Difference]: Start difference. First operand has 1168 states, 1163 states have (on average 1.4496990541702492) internal successors, (1686), 1163 states have internal predecessors, (1686), 3 states have call successors, (3), 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 1168 states. [2022-04-08 08:55:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:11,465 INFO L93 Difference]: Finished difference Result 1168 states and 1690 transitions. [2022-04-08 08:55:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1690 transitions. [2022-04-08 08:55:11,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:11,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:11,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:11,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1163 states have (on average 1.4496990541702492) internal successors, (1686), 1163 states have internal predecessors, (1686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1690 transitions. [2022-04-08 08:55:11,514 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1690 transitions. Word has length 171 [2022-04-08 08:55:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:11,514 INFO L478 AbstractCegarLoop]: Abstraction has 1168 states and 1690 transitions. [2022-04-08 08:55:11,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:11,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1168 states and 1690 transitions. [2022-04-08 08:55:13,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1690 edges. 1690 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1690 transitions. [2022-04-08 08:55:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-08 08:55:13,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:13,301 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:55:13,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-08 08:55:13,301 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash 385291761, now seen corresponding path program 1 times [2022-04-08 08:55:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:13,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [589194413] [2022-04-08 08:55:13,431 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:13,431 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:13,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 385291761, now seen corresponding path program 2 times [2022-04-08 08:55:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:13,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744235396] [2022-04-08 08:55:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:13,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:13,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {304501#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {304495#true} is VALID [2022-04-08 08:55:13,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {304495#true} assume true; {304495#true} is VALID [2022-04-08 08:55:13,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {304495#true} {304495#true} #710#return; {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {304495#true} call ULTIMATE.init(); {304501#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:13,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {304501#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {304495#true} assume true; {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304495#true} {304495#true} #710#return; {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {304495#true} call #t~ret161 := main(); {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {304495#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {304495#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L272 TraceCheckUtils]: 7: Hoare triple {304495#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {304495#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {304495#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {304495#true} is VALID [2022-04-08 08:55:13,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {304495#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {304495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {304495#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {304495#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {304495#true} assume !false; {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {304495#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {304495#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {304495#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {304495#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {304495#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {304495#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {304495#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {304495#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {304495#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {304495#true} assume 8464 == #t~mem55;havoc #t~mem55; {304495#true} is VALID [2022-04-08 08:55:13,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {304495#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {304495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {304495#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {304495#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {304495#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {304495#true} ~skip~0 := 0; {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {304495#true} assume !false; {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {304495#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {304495#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {304495#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {304495#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {304495#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {304495#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {304495#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {304495#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {304495#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {304495#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {304495#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {304495#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {304495#true} assume 8496 == #t~mem58;havoc #t~mem58; {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {304495#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {304495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {304495#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {304495#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {304495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {304495#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {304495#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {304495#true} ~skip~0 := 0; {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {304495#true} assume !false; {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 54: Hoare triple {304495#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,645 INFO L290 TraceCheckUtils]: 55: Hoare triple {304495#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {304495#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {304495#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {304495#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {304495#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 60: Hoare triple {304495#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {304495#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {304495#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {304495#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {304495#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {304495#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 66: Hoare triple {304495#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 67: Hoare triple {304495#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 68: Hoare triple {304495#true} assume 8512 == #t~mem60;havoc #t~mem60; {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 69: Hoare triple {304495#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {304495#true} is VALID [2022-04-08 08:55:13,646 INFO L290 TraceCheckUtils]: 70: Hoare triple {304495#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {304495#true} is VALID [2022-04-08 08:55:13,647 INFO L290 TraceCheckUtils]: 71: Hoare triple {304495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,647 INFO L290 TraceCheckUtils]: 72: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,647 INFO L290 TraceCheckUtils]: 73: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,648 INFO L290 TraceCheckUtils]: 74: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,649 INFO L290 TraceCheckUtils]: 78: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,649 INFO L290 TraceCheckUtils]: 79: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,649 INFO L290 TraceCheckUtils]: 80: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,650 INFO L290 TraceCheckUtils]: 81: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,650 INFO L290 TraceCheckUtils]: 82: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,651 INFO L290 TraceCheckUtils]: 87: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,651 INFO L290 TraceCheckUtils]: 88: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,652 INFO L290 TraceCheckUtils]: 89: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,652 INFO L290 TraceCheckUtils]: 90: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,652 INFO L290 TraceCheckUtils]: 91: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,653 INFO L290 TraceCheckUtils]: 92: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,653 INFO L290 TraceCheckUtils]: 93: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,653 INFO L290 TraceCheckUtils]: 94: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,653 INFO L290 TraceCheckUtils]: 95: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,654 INFO L290 TraceCheckUtils]: 96: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,654 INFO L290 TraceCheckUtils]: 97: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume 8545 == #t~mem65;havoc #t~mem65; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,654 INFO L290 TraceCheckUtils]: 98: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,654 INFO L290 TraceCheckUtils]: 99: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,655 INFO L290 TraceCheckUtils]: 100: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,655 INFO L290 TraceCheckUtils]: 101: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,655 INFO L290 TraceCheckUtils]: 102: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 103: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {304500#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 104: Hoare triple {304500#(= 3 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {304496#false} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 105: Hoare triple {304496#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 106: Hoare triple {304496#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 107: Hoare triple {304496#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304496#false} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 108: Hoare triple {304496#false} ~skip~0 := 0; {304496#false} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 109: Hoare triple {304496#false} assume !false; {304496#false} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 110: Hoare triple {304496#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,656 INFO L290 TraceCheckUtils]: 111: Hoare triple {304496#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 112: Hoare triple {304496#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 113: Hoare triple {304496#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 114: Hoare triple {304496#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 115: Hoare triple {304496#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 116: Hoare triple {304496#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 117: Hoare triple {304496#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 118: Hoare triple {304496#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 119: Hoare triple {304496#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 120: Hoare triple {304496#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 121: Hoare triple {304496#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 122: Hoare triple {304496#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 123: Hoare triple {304496#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 124: Hoare triple {304496#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 125: Hoare triple {304496#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,657 INFO L290 TraceCheckUtils]: 126: Hoare triple {304496#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 127: Hoare triple {304496#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 128: Hoare triple {304496#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 129: Hoare triple {304496#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 130: Hoare triple {304496#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 131: Hoare triple {304496#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 132: Hoare triple {304496#false} assume 8448 == #t~mem68;havoc #t~mem68; {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 133: Hoare triple {304496#false} assume !(~num1~0 > 0); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 134: Hoare triple {304496#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 135: Hoare triple {304496#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 136: Hoare triple {304496#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 137: Hoare triple {304496#false} ~skip~0 := 0; {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 138: Hoare triple {304496#false} assume !false; {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 139: Hoare triple {304496#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 140: Hoare triple {304496#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,658 INFO L290 TraceCheckUtils]: 141: Hoare triple {304496#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 142: Hoare triple {304496#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 143: Hoare triple {304496#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 144: Hoare triple {304496#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 145: Hoare triple {304496#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 146: Hoare triple {304496#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 147: Hoare triple {304496#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 148: Hoare triple {304496#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 149: Hoare triple {304496#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 150: Hoare triple {304496#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 151: Hoare triple {304496#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 152: Hoare triple {304496#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 153: Hoare triple {304496#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 154: Hoare triple {304496#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 155: Hoare triple {304496#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,659 INFO L290 TraceCheckUtils]: 156: Hoare triple {304496#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 157: Hoare triple {304496#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 158: Hoare triple {304496#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 159: Hoare triple {304496#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 160: Hoare triple {304496#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 161: Hoare triple {304496#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 162: Hoare triple {304496#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 163: Hoare triple {304496#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 164: Hoare triple {304496#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 165: Hoare triple {304496#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 166: Hoare triple {304496#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 167: Hoare triple {304496#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 168: Hoare triple {304496#false} assume 8640 == #t~mem75;havoc #t~mem75; {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 169: Hoare triple {304496#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 170: Hoare triple {304496#false} assume !(9 == ~blastFlag~0); {304496#false} is VALID [2022-04-08 08:55:13,660 INFO L290 TraceCheckUtils]: 171: Hoare triple {304496#false} assume 12 == ~blastFlag~0; {304496#false} is VALID [2022-04-08 08:55:13,661 INFO L290 TraceCheckUtils]: 172: Hoare triple {304496#false} assume !false; {304496#false} is VALID [2022-04-08 08:55:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 08:55:13,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744235396] [2022-04-08 08:55:13,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744235396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:13,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:13,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:55:13,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [589194413] [2022-04-08 08:55:13,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [589194413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:13,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:13,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:55:13,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523186985] [2022-04-08 08:55:13,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:13,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 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 173 [2022-04-08 08:55:13,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:13,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:13,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:13,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:55:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:13,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:55:13,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:55:13,748 INFO L87 Difference]: Start difference. First operand 1168 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:15,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:19,655 INFO L93 Difference]: Finished difference Result 2863 states and 4165 transitions. [2022-04-08 08:55:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:55:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 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 173 [2022-04-08 08:55:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2022-04-08 08:55:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2022-04-08 08:55:19,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 623 transitions. [2022-04-08 08:55:20,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:20,216 INFO L225 Difference]: With dead ends: 2863 [2022-04-08 08:55:20,216 INFO L226 Difference]: Without dead ends: 1723 [2022-04-08 08:55:20,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:55:20,218 INFO L913 BasicCegarLoop]: 389 mSDtfsCounter, 154 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:20,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 583 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 08:55:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2022-04-08 08:55:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2022-04-08 08:55:20,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:20,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1723 states. Second operand has 1723 states, 1718 states have (on average 1.449359720605355) internal successors, (2490), 1718 states have internal predecessors, (2490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:20,346 INFO L74 IsIncluded]: Start isIncluded. First operand 1723 states. Second operand has 1723 states, 1718 states have (on average 1.449359720605355) internal successors, (2490), 1718 states have internal predecessors, (2490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:20,347 INFO L87 Difference]: Start difference. First operand 1723 states. Second operand has 1723 states, 1718 states have (on average 1.449359720605355) internal successors, (2490), 1718 states have internal predecessors, (2490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:20,420 INFO L93 Difference]: Finished difference Result 1723 states and 2494 transitions. [2022-04-08 08:55:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2494 transitions. [2022-04-08 08:55:20,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:20,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:20,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 1723 states, 1718 states have (on average 1.449359720605355) internal successors, (2490), 1718 states have internal predecessors, (2490), 3 states have call successors, (3), 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 1723 states. [2022-04-08 08:55:20,423 INFO L87 Difference]: Start difference. First operand has 1723 states, 1718 states have (on average 1.449359720605355) internal successors, (2490), 1718 states have internal predecessors, (2490), 3 states have call successors, (3), 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 1723 states. [2022-04-08 08:55:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:20,496 INFO L93 Difference]: Finished difference Result 1723 states and 2494 transitions. [2022-04-08 08:55:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2494 transitions. [2022-04-08 08:55:20,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:20,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:20,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:20,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1718 states have (on average 1.449359720605355) internal successors, (2490), 1718 states have internal predecessors, (2490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2494 transitions. [2022-04-08 08:55:20,624 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2494 transitions. Word has length 173 [2022-04-08 08:55:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:20,624 INFO L478 AbstractCegarLoop]: Abstraction has 1723 states and 2494 transitions. [2022-04-08 08:55:20,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:20,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1723 states and 2494 transitions. [2022-04-08 08:55:23,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2494 edges. 2494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2494 transitions. [2022-04-08 08:55:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-04-08 08:55:23,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:23,436 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:55:23,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-08 08:55:23,436 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1704769598, now seen corresponding path program 1 times [2022-04-08 08:55:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:23,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394389999] [2022-04-08 08:55:23,578 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:23,578 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:23,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1704769598, now seen corresponding path program 2 times [2022-04-08 08:55:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:23,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639841749] [2022-04-08 08:55:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:23,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {317128#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {317122#true} is VALID [2022-04-08 08:55:23,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {317122#true} assume true; {317122#true} is VALID [2022-04-08 08:55:23,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {317122#true} {317122#true} #710#return; {317122#true} is VALID [2022-04-08 08:55:23,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {317122#true} call ULTIMATE.init(); {317128#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:23,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {317128#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {317122#true} is VALID [2022-04-08 08:55:23,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {317122#true} assume true; {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {317122#true} {317122#true} #710#return; {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {317122#true} call #t~ret161 := main(); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {317122#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {317122#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L272 TraceCheckUtils]: 7: Hoare triple {317122#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {317122#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {317122#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {317122#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {317122#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {317122#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {317122#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {317122#true} assume !false; {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {317122#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {317122#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {317122#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {317122#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {317122#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {317122#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {317122#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {317122#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {317122#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {317122#true} assume 8464 == #t~mem55;havoc #t~mem55; {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {317122#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {317122#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {317122#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {317122#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {317122#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {317122#true} ~skip~0 := 0; {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {317122#true} assume !false; {317122#true} is VALID [2022-04-08 08:55:23,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {317122#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {317122#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {317122#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {317122#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {317122#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {317122#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {317122#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {317122#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {317122#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {317122#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {317122#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {317122#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {317122#true} assume 8496 == #t~mem58;havoc #t~mem58; {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {317122#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {317122#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {317122#true} is VALID [2022-04-08 08:55:23,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {317122#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {317122#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {317122#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {317122#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {317122#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {317122#true} ~skip~0 := 0; {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {317122#true} assume !false; {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {317122#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {317122#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {317122#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {317122#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {317122#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {317122#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {317122#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {317122#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {317122#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {317122#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {317122#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {317122#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 66: Hoare triple {317122#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 67: Hoare triple {317122#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 68: Hoare triple {317122#true} assume 8512 == #t~mem60;havoc #t~mem60; {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {317122#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {317122#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 71: Hoare triple {317122#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {317122#true} assume !(~ret~0 <= 0); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {317122#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {317122#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {317122#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {317122#true} ~skip~0 := 0; {317122#true} is VALID [2022-04-08 08:55:23,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {317122#true} assume !false; {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {317122#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 79: Hoare triple {317122#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 80: Hoare triple {317122#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 81: Hoare triple {317122#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 82: Hoare triple {317122#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 83: Hoare triple {317122#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 84: Hoare triple {317122#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 85: Hoare triple {317122#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 86: Hoare triple {317122#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 87: Hoare triple {317122#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 88: Hoare triple {317122#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 89: Hoare triple {317122#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 90: Hoare triple {317122#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 91: Hoare triple {317122#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,766 INFO L290 TraceCheckUtils]: 92: Hoare triple {317122#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {317122#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {317122#true} assume 8528 == #t~mem62;havoc #t~mem62; {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 95: Hoare triple {317122#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 96: Hoare triple {317122#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 97: Hoare triple {317122#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 98: Hoare triple {317122#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 99: Hoare triple {317122#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 100: Hoare triple {317122#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 101: Hoare triple {317122#true} assume !(~ret~0 <= 0); {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 102: Hoare triple {317122#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 103: Hoare triple {317122#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 104: Hoare triple {317122#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 105: Hoare triple {317122#true} ~skip~0 := 0; {317122#true} is VALID [2022-04-08 08:55:23,767 INFO L290 TraceCheckUtils]: 106: Hoare triple {317122#true} assume !false; {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 107: Hoare triple {317122#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 108: Hoare triple {317122#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 109: Hoare triple {317122#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 110: Hoare triple {317122#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 111: Hoare triple {317122#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 112: Hoare triple {317122#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 113: Hoare triple {317122#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 114: Hoare triple {317122#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 115: Hoare triple {317122#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 116: Hoare triple {317122#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 117: Hoare triple {317122#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 118: Hoare triple {317122#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 119: Hoare triple {317122#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 120: Hoare triple {317122#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,768 INFO L290 TraceCheckUtils]: 121: Hoare triple {317122#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 122: Hoare triple {317122#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 123: Hoare triple {317122#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 124: Hoare triple {317122#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 125: Hoare triple {317122#true} assume 8544 == #t~mem64;havoc #t~mem64; {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 126: Hoare triple {317122#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 127: Hoare triple {317122#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 128: Hoare triple {317122#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 129: Hoare triple {317122#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 130: Hoare triple {317122#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 131: Hoare triple {317122#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {317122#true} is VALID [2022-04-08 08:55:23,769 INFO L290 TraceCheckUtils]: 132: Hoare triple {317122#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,770 INFO L290 TraceCheckUtils]: 133: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,770 INFO L290 TraceCheckUtils]: 134: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,770 INFO L290 TraceCheckUtils]: 135: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,770 INFO L290 TraceCheckUtils]: 136: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,771 INFO L290 TraceCheckUtils]: 137: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,771 INFO L290 TraceCheckUtils]: 138: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,771 INFO L290 TraceCheckUtils]: 139: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,772 INFO L290 TraceCheckUtils]: 140: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,772 INFO L290 TraceCheckUtils]: 141: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,772 INFO L290 TraceCheckUtils]: 142: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,772 INFO L290 TraceCheckUtils]: 143: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,773 INFO L290 TraceCheckUtils]: 144: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,773 INFO L290 TraceCheckUtils]: 145: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,773 INFO L290 TraceCheckUtils]: 146: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,774 INFO L290 TraceCheckUtils]: 147: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,774 INFO L290 TraceCheckUtils]: 148: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,774 INFO L290 TraceCheckUtils]: 149: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,775 INFO L290 TraceCheckUtils]: 150: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,775 INFO L290 TraceCheckUtils]: 151: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,775 INFO L290 TraceCheckUtils]: 152: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,776 INFO L290 TraceCheckUtils]: 153: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,776 INFO L290 TraceCheckUtils]: 154: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,776 INFO L290 TraceCheckUtils]: 155: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,776 INFO L290 TraceCheckUtils]: 156: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,777 INFO L290 TraceCheckUtils]: 157: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,777 INFO L290 TraceCheckUtils]: 158: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,777 INFO L290 TraceCheckUtils]: 159: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,778 INFO L290 TraceCheckUtils]: 160: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume 8448 == #t~mem68;havoc #t~mem68; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,778 INFO L290 TraceCheckUtils]: 161: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(~num1~0 > 0); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,778 INFO L290 TraceCheckUtils]: 162: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,779 INFO L290 TraceCheckUtils]: 163: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,779 INFO L290 TraceCheckUtils]: 164: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,779 INFO L290 TraceCheckUtils]: 165: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,780 INFO L290 TraceCheckUtils]: 166: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,780 INFO L290 TraceCheckUtils]: 167: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,780 INFO L290 TraceCheckUtils]: 168: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,780 INFO L290 TraceCheckUtils]: 169: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,781 INFO L290 TraceCheckUtils]: 170: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,781 INFO L290 TraceCheckUtils]: 171: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,781 INFO L290 TraceCheckUtils]: 172: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,782 INFO L290 TraceCheckUtils]: 173: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,782 INFO L290 TraceCheckUtils]: 174: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,782 INFO L290 TraceCheckUtils]: 175: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,783 INFO L290 TraceCheckUtils]: 176: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,783 INFO L290 TraceCheckUtils]: 177: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,783 INFO L290 TraceCheckUtils]: 178: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,783 INFO L290 TraceCheckUtils]: 179: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,784 INFO L290 TraceCheckUtils]: 180: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,784 INFO L290 TraceCheckUtils]: 181: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,784 INFO L290 TraceCheckUtils]: 182: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,785 INFO L290 TraceCheckUtils]: 183: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,785 INFO L290 TraceCheckUtils]: 184: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,785 INFO L290 TraceCheckUtils]: 185: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,786 INFO L290 TraceCheckUtils]: 186: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,786 INFO L290 TraceCheckUtils]: 187: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,786 INFO L290 TraceCheckUtils]: 188: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,787 INFO L290 TraceCheckUtils]: 189: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,787 INFO L290 TraceCheckUtils]: 190: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,787 INFO L290 TraceCheckUtils]: 191: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,787 INFO L290 TraceCheckUtils]: 192: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,788 INFO L290 TraceCheckUtils]: 193: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,788 INFO L290 TraceCheckUtils]: 194: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,788 INFO L290 TraceCheckUtils]: 195: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,788 INFO L290 TraceCheckUtils]: 196: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume 8640 == #t~mem75;havoc #t~mem75; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,789 INFO L290 TraceCheckUtils]: 197: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,789 INFO L290 TraceCheckUtils]: 198: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume !(9 == ~blastFlag~0); {317127#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-08 08:55:23,789 INFO L290 TraceCheckUtils]: 199: Hoare triple {317127#(<= ssl3_accept_~blastFlag~0 5)} assume 12 == ~blastFlag~0; {317123#false} is VALID [2022-04-08 08:55:23,789 INFO L290 TraceCheckUtils]: 200: Hoare triple {317123#false} assume !false; {317123#false} is VALID [2022-04-08 08:55:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-04-08 08:55:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:23,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639841749] [2022-04-08 08:55:23,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639841749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:23,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:23,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:55:23,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:23,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394389999] [2022-04-08 08:55:23,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394389999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:23,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:23,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:55:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842648672] [2022-04-08 08:55:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:23,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 201 [2022-04-08 08:55:23,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:23,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:23,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:23,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:55:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:55:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:55:23,868 INFO L87 Difference]: Start difference. First operand 1723 states and 2494 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:25,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:29,745 INFO L93 Difference]: Finished difference Result 3974 states and 5774 transitions. [2022-04-08 08:55:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:55:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 201 [2022-04-08 08:55:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2022-04-08 08:55:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2022-04-08 08:55:29,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 624 transitions. [2022-04-08 08:55:30,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:30,318 INFO L225 Difference]: With dead ends: 3974 [2022-04-08 08:55:30,318 INFO L226 Difference]: Without dead ends: 2279 [2022-04-08 08:55:30,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:55:30,320 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:30,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 384 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 258 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 08:55:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-04-08 08:55:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2279. [2022-04-08 08:55:31,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:31,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2279 states. Second operand has 2279 states, 2274 states have (on average 1.4516270888302552) internal successors, (3301), 2274 states have internal predecessors, (3301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,133 INFO L74 IsIncluded]: Start isIncluded. First operand 2279 states. Second operand has 2279 states, 2274 states have (on average 1.4516270888302552) internal successors, (3301), 2274 states have internal predecessors, (3301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,134 INFO L87 Difference]: Start difference. First operand 2279 states. Second operand has 2279 states, 2274 states have (on average 1.4516270888302552) internal successors, (3301), 2274 states have internal predecessors, (3301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:31,266 INFO L93 Difference]: Finished difference Result 2279 states and 3305 transitions. [2022-04-08 08:55:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3305 transitions. [2022-04-08 08:55:31,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:31,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:31,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 2279 states, 2274 states have (on average 1.4516270888302552) internal successors, (3301), 2274 states have internal predecessors, (3301), 3 states have call successors, (3), 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 2279 states. [2022-04-08 08:55:31,270 INFO L87 Difference]: Start difference. First operand has 2279 states, 2274 states have (on average 1.4516270888302552) internal successors, (3301), 2274 states have internal predecessors, (3301), 3 states have call successors, (3), 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 2279 states. [2022-04-08 08:55:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:31,397 INFO L93 Difference]: Finished difference Result 2279 states and 3305 transitions. [2022-04-08 08:55:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3305 transitions. [2022-04-08 08:55:31,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:31,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:31,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:31,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2274 states have (on average 1.4516270888302552) internal successors, (3301), 2274 states have internal predecessors, (3301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3305 transitions. [2022-04-08 08:55:31,670 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3305 transitions. Word has length 201 [2022-04-08 08:55:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:31,670 INFO L478 AbstractCegarLoop]: Abstraction has 2279 states and 3305 transitions. [2022-04-08 08:55:31,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:31,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2279 states and 3305 transitions. [2022-04-08 08:55:35,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3305 edges. 3305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3305 transitions. [2022-04-08 08:55:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-04-08 08:55:35,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:35,423 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:55:35,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-08 08:55:35,423 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1343912404, now seen corresponding path program 1 times [2022-04-08 08:55:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1082147800] [2022-04-08 08:55:35,591 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:35,591 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:35,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1343912404, now seen corresponding path program 2 times [2022-04-08 08:55:35,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:35,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016344328] [2022-04-08 08:55:35,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:35,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {334202#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {334195#true} is VALID [2022-04-08 08:55:35,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {334195#true} assume true; {334195#true} is VALID [2022-04-08 08:55:35,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {334195#true} {334195#true} #710#return; {334195#true} is VALID [2022-04-08 08:55:35,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {334195#true} call ULTIMATE.init(); {334202#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:35,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {334202#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {334195#true} assume true; {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334195#true} {334195#true} #710#return; {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {334195#true} call #t~ret161 := main(); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {334195#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {334195#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L272 TraceCheckUtils]: 7: Hoare triple {334195#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {334195#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {334195#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {334195#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {334195#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {334195#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {334195#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {334195#true} assume !false; {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {334195#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {334195#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {334195#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {334195#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {334195#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {334195#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {334195#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {334195#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {334195#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {334195#true} assume 8464 == #t~mem55;havoc #t~mem55; {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {334195#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {334195#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {334195#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {334195#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {334195#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {334195#true} ~skip~0 := 0; {334195#true} is VALID [2022-04-08 08:55:35,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {334195#true} assume !false; {334195#true} is VALID [2022-04-08 08:55:35,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {334195#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {334195#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {334195#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {334195#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {334195#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {334195#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {334195#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {334195#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {334195#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {334195#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {334195#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {334195#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {334195#true} assume 8496 == #t~mem58;havoc #t~mem58; {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {334195#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {334195#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {334195#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {334195#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {334195#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {334195#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {334195#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {334195#true} ~skip~0 := 0; {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {334195#true} assume !false; {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {334195#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {334195#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {334195#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {334195#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {334195#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {334195#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {334195#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {334195#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {334195#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {334195#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {334195#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {334195#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {334195#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {334195#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {334195#true} assume 8512 == #t~mem60;havoc #t~mem60; {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {334195#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {334195#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {334195#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {334195#true} assume !(~ret~0 <= 0); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {334195#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {334195#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {334195#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {334195#true} ~skip~0 := 0; {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {334195#true} assume !false; {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {334195#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {334195#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {334195#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,813 INFO L290 TraceCheckUtils]: 81: Hoare triple {334195#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {334195#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 83: Hoare triple {334195#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 84: Hoare triple {334195#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 85: Hoare triple {334195#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {334195#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {334195#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {334195#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {334195#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 90: Hoare triple {334195#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 91: Hoare triple {334195#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 92: Hoare triple {334195#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 93: Hoare triple {334195#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 94: Hoare triple {334195#true} assume 8528 == #t~mem62;havoc #t~mem62; {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 95: Hoare triple {334195#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,814 INFO L290 TraceCheckUtils]: 96: Hoare triple {334195#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {334195#true} is VALID [2022-04-08 08:55:35,815 INFO L290 TraceCheckUtils]: 97: Hoare triple {334195#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {334195#true} is VALID [2022-04-08 08:55:35,815 INFO L290 TraceCheckUtils]: 98: Hoare triple {334195#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {334195#true} is VALID [2022-04-08 08:55:35,815 INFO L290 TraceCheckUtils]: 99: Hoare triple {334195#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {334195#true} is VALID [2022-04-08 08:55:35,815 INFO L290 TraceCheckUtils]: 100: Hoare triple {334195#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {334195#true} is VALID [2022-04-08 08:55:35,815 INFO L290 TraceCheckUtils]: 101: Hoare triple {334195#true} assume !(~ret~0 <= 0); {334195#true} is VALID [2022-04-08 08:55:35,816 INFO L290 TraceCheckUtils]: 102: Hoare triple {334195#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,816 INFO L290 TraceCheckUtils]: 103: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,817 INFO L290 TraceCheckUtils]: 104: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,817 INFO L290 TraceCheckUtils]: 105: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,818 INFO L290 TraceCheckUtils]: 106: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,818 INFO L290 TraceCheckUtils]: 107: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,818 INFO L290 TraceCheckUtils]: 108: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,819 INFO L290 TraceCheckUtils]: 109: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,819 INFO L290 TraceCheckUtils]: 110: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,820 INFO L290 TraceCheckUtils]: 111: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,820 INFO L290 TraceCheckUtils]: 112: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,820 INFO L290 TraceCheckUtils]: 113: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,821 INFO L290 TraceCheckUtils]: 114: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,821 INFO L290 TraceCheckUtils]: 115: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,822 INFO L290 TraceCheckUtils]: 116: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,822 INFO L290 TraceCheckUtils]: 117: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,822 INFO L290 TraceCheckUtils]: 118: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,823 INFO L290 TraceCheckUtils]: 119: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,823 INFO L290 TraceCheckUtils]: 120: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,823 INFO L290 TraceCheckUtils]: 121: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,824 INFO L290 TraceCheckUtils]: 122: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,824 INFO L290 TraceCheckUtils]: 123: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,825 INFO L290 TraceCheckUtils]: 124: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,825 INFO L290 TraceCheckUtils]: 125: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,825 INFO L290 TraceCheckUtils]: 126: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,826 INFO L290 TraceCheckUtils]: 127: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,826 INFO L290 TraceCheckUtils]: 128: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 129: Hoare triple {334200#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {334201#(not (= 8576 |ssl3_accept_#t~mem69|))} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 130: Hoare triple {334201#(not (= 8576 |ssl3_accept_#t~mem69|))} assume 8576 == #t~mem69;havoc #t~mem69; {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 131: Hoare triple {334196#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 132: Hoare triple {334196#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 133: Hoare triple {334196#false} assume !(~ret~0 <= 0); {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 134: Hoare triple {334196#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 135: Hoare triple {334196#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 136: Hoare triple {334196#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 137: Hoare triple {334196#false} ~skip~0 := 0; {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 138: Hoare triple {334196#false} assume !false; {334196#false} is VALID [2022-04-08 08:55:35,827 INFO L290 TraceCheckUtils]: 139: Hoare triple {334196#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 140: Hoare triple {334196#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 141: Hoare triple {334196#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 142: Hoare triple {334196#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 143: Hoare triple {334196#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 144: Hoare triple {334196#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 145: Hoare triple {334196#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 146: Hoare triple {334196#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 147: Hoare triple {334196#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 148: Hoare triple {334196#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 149: Hoare triple {334196#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 150: Hoare triple {334196#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 151: Hoare triple {334196#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 152: Hoare triple {334196#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 153: Hoare triple {334196#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,828 INFO L290 TraceCheckUtils]: 154: Hoare triple {334196#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 155: Hoare triple {334196#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 156: Hoare triple {334196#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 157: Hoare triple {334196#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 158: Hoare triple {334196#false} assume 8545 == #t~mem65;havoc #t~mem65; {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 159: Hoare triple {334196#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 160: Hoare triple {334196#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 161: Hoare triple {334196#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 162: Hoare triple {334196#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 163: Hoare triple {334196#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 164: Hoare triple {334196#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 165: Hoare triple {334196#false} assume !(4 == ~blastFlag~0); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 166: Hoare triple {334196#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 167: Hoare triple {334196#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 168: Hoare triple {334196#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {334196#false} is VALID [2022-04-08 08:55:35,829 INFO L290 TraceCheckUtils]: 169: Hoare triple {334196#false} ~skip~0 := 0; {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 170: Hoare triple {334196#false} assume !false; {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 171: Hoare triple {334196#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 172: Hoare triple {334196#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 173: Hoare triple {334196#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 174: Hoare triple {334196#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 175: Hoare triple {334196#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 176: Hoare triple {334196#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 177: Hoare triple {334196#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 178: Hoare triple {334196#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 179: Hoare triple {334196#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 180: Hoare triple {334196#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 181: Hoare triple {334196#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 182: Hoare triple {334196#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 183: Hoare triple {334196#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 184: Hoare triple {334196#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,830 INFO L290 TraceCheckUtils]: 185: Hoare triple {334196#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 186: Hoare triple {334196#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 187: Hoare triple {334196#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 188: Hoare triple {334196#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 189: Hoare triple {334196#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 190: Hoare triple {334196#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 191: Hoare triple {334196#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 192: Hoare triple {334196#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 193: Hoare triple {334196#false} assume 8448 == #t~mem68;havoc #t~mem68; {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 194: Hoare triple {334196#false} assume !(~num1~0 > 0); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 195: Hoare triple {334196#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 196: Hoare triple {334196#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 197: Hoare triple {334196#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 198: Hoare triple {334196#false} ~skip~0 := 0; {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 199: Hoare triple {334196#false} assume !false; {334196#false} is VALID [2022-04-08 08:55:35,831 INFO L290 TraceCheckUtils]: 200: Hoare triple {334196#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 201: Hoare triple {334196#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 202: Hoare triple {334196#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 203: Hoare triple {334196#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 204: Hoare triple {334196#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 205: Hoare triple {334196#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 206: Hoare triple {334196#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 207: Hoare triple {334196#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 208: Hoare triple {334196#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 209: Hoare triple {334196#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 210: Hoare triple {334196#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 211: Hoare triple {334196#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 212: Hoare triple {334196#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 213: Hoare triple {334196#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 214: Hoare triple {334196#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 215: Hoare triple {334196#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,832 INFO L290 TraceCheckUtils]: 216: Hoare triple {334196#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 217: Hoare triple {334196#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 218: Hoare triple {334196#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 219: Hoare triple {334196#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 220: Hoare triple {334196#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 221: Hoare triple {334196#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 222: Hoare triple {334196#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 223: Hoare triple {334196#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 224: Hoare triple {334196#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 225: Hoare triple {334196#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 226: Hoare triple {334196#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 227: Hoare triple {334196#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 228: Hoare triple {334196#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 229: Hoare triple {334196#false} assume 8640 == #t~mem75;havoc #t~mem75; {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 230: Hoare triple {334196#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 231: Hoare triple {334196#false} assume !(9 == ~blastFlag~0); {334196#false} is VALID [2022-04-08 08:55:35,833 INFO L290 TraceCheckUtils]: 232: Hoare triple {334196#false} assume 12 == ~blastFlag~0; {334196#false} is VALID [2022-04-08 08:55:35,834 INFO L290 TraceCheckUtils]: 233: Hoare triple {334196#false} assume !false; {334196#false} is VALID [2022-04-08 08:55:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-04-08 08:55:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:35,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016344328] [2022-04-08 08:55:35,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016344328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:35,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:35,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:35,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1082147800] [2022-04-08 08:55:35,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1082147800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:35,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:35,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861955617] [2022-04-08 08:55:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 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 234 [2022-04-08 08:55:35,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:35,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:35,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:35,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:55:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:55:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:55:35,930 INFO L87 Difference]: Start difference. First operand 2279 states and 3305 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:40,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:43,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:55:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:52,471 INFO L93 Difference]: Finished difference Result 4955 states and 7168 transitions. [2022-04-08 08:55:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:55:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 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 234 [2022-04-08 08:55:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:55:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:55:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:55:52,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-08 08:55:52,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:53,231 INFO L225 Difference]: With dead ends: 4955 [2022-04-08 08:55:53,231 INFO L226 Difference]: Without dead ends: 2704 [2022-04-08 08:55:53,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:55:53,234 INFO L913 BasicCegarLoop]: 151 mSDtfsCounter, 118 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:55:53,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 416 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-08 08:55:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2022-04-08 08:55:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2411. [2022-04-08 08:55:54,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:55:54,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2704 states. Second operand has 2411 states, 2406 states have (on average 1.443474646716542) internal successors, (3473), 2406 states have internal predecessors, (3473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:54,176 INFO L74 IsIncluded]: Start isIncluded. First operand 2704 states. Second operand has 2411 states, 2406 states have (on average 1.443474646716542) internal successors, (3473), 2406 states have internal predecessors, (3473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:54,177 INFO L87 Difference]: Start difference. First operand 2704 states. Second operand has 2411 states, 2406 states have (on average 1.443474646716542) internal successors, (3473), 2406 states have internal predecessors, (3473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:54,469 INFO L93 Difference]: Finished difference Result 2704 states and 3871 transitions. [2022-04-08 08:55:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3871 transitions. [2022-04-08 08:55:54,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:54,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:54,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 2411 states, 2406 states have (on average 1.443474646716542) internal successors, (3473), 2406 states have internal predecessors, (3473), 3 states have call successors, (3), 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 2704 states. [2022-04-08 08:55:54,476 INFO L87 Difference]: Start difference. First operand has 2411 states, 2406 states have (on average 1.443474646716542) internal successors, (3473), 2406 states have internal predecessors, (3473), 3 states have call successors, (3), 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 2704 states. [2022-04-08 08:55:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:55:54,752 INFO L93 Difference]: Finished difference Result 2704 states and 3871 transitions. [2022-04-08 08:55:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3871 transitions. [2022-04-08 08:55:54,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:55:54,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:55:54,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:55:54,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:55:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2406 states have (on average 1.443474646716542) internal successors, (3473), 2406 states have internal predecessors, (3473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3477 transitions. [2022-04-08 08:55:55,000 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3477 transitions. Word has length 234 [2022-04-08 08:55:55,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:55:55,000 INFO L478 AbstractCegarLoop]: Abstraction has 2411 states and 3477 transitions. [2022-04-08 08:55:55,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:55,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2411 states and 3477 transitions. [2022-04-08 08:55:59,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3477 edges. 3477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3477 transitions. [2022-04-08 08:55:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-04-08 08:55:59,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:55:59,046 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:55:59,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-08 08:55:59,046 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:55:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:55:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash -938763540, now seen corresponding path program 1 times [2022-04-08 08:55:59,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:59,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1222783216] [2022-04-08 08:55:59,208 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:55:59,208 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 08:55:59,208 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:55:59,208 INFO L85 PathProgramCache]: Analyzing trace with hash -938763540, now seen corresponding path program 2 times [2022-04-08 08:55:59,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:55:59,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051643356] [2022-04-08 08:55:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:55:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:55:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:55:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:55:59,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {354354#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {354347#true} is VALID [2022-04-08 08:55:59,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {354347#true} assume true; {354347#true} is VALID [2022-04-08 08:55:59,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {354347#true} {354347#true} #710#return; {354347#true} is VALID [2022-04-08 08:55:59,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {354347#true} call ULTIMATE.init(); {354354#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:55:59,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {354354#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {354347#true} assume true; {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354347#true} {354347#true} #710#return; {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {354347#true} call #t~ret161 := main(); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {354347#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {354347#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L272 TraceCheckUtils]: 7: Hoare triple {354347#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {354347#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {354347#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {354347#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {354347#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {354347#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {354347#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {354347#true} assume !false; {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {354347#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {354347#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {354347#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {354347#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {354347#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {354347#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {354347#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {354347#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {354347#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {354347#true} assume 8464 == #t~mem55;havoc #t~mem55; {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {354347#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {354347#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {354347#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {354347#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {354347#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {354347#true} ~skip~0 := 0; {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {354347#true} assume !false; {354347#true} is VALID [2022-04-08 08:55:59,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {354347#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {354347#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {354347#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {354347#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {354347#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {354347#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {354347#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {354347#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {354347#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {354347#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {354347#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {354347#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {354347#true} assume 8496 == #t~mem58;havoc #t~mem58; {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {354347#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {354347#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {354347#true} is VALID [2022-04-08 08:55:59,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {354347#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {354347#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {354347#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 50: Hoare triple {354347#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {354347#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {354347#true} ~skip~0 := 0; {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {354347#true} assume !false; {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {354347#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {354347#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {354347#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {354347#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {354347#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {354347#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {354347#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {354347#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {354347#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {354347#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {354347#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {354347#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 66: Hoare triple {354347#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {354347#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 68: Hoare triple {354347#true} assume 8512 == #t~mem60;havoc #t~mem60; {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 69: Hoare triple {354347#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 70: Hoare triple {354347#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 71: Hoare triple {354347#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 72: Hoare triple {354347#true} assume !(~ret~0 <= 0); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 73: Hoare triple {354347#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 74: Hoare triple {354347#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 75: Hoare triple {354347#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 76: Hoare triple {354347#true} ~skip~0 := 0; {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 77: Hoare triple {354347#true} assume !false; {354347#true} is VALID [2022-04-08 08:55:59,477 INFO L290 TraceCheckUtils]: 78: Hoare triple {354347#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 79: Hoare triple {354347#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 80: Hoare triple {354347#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 81: Hoare triple {354347#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 82: Hoare triple {354347#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 83: Hoare triple {354347#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 84: Hoare triple {354347#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 85: Hoare triple {354347#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 86: Hoare triple {354347#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 87: Hoare triple {354347#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 88: Hoare triple {354347#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {354347#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {354347#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 91: Hoare triple {354347#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 92: Hoare triple {354347#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,478 INFO L290 TraceCheckUtils]: 93: Hoare triple {354347#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 94: Hoare triple {354347#true} assume 8528 == #t~mem62;havoc #t~mem62; {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 95: Hoare triple {354347#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 96: Hoare triple {354347#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 97: Hoare triple {354347#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 98: Hoare triple {354347#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 99: Hoare triple {354347#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 100: Hoare triple {354347#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {354347#true} is VALID [2022-04-08 08:55:59,479 INFO L290 TraceCheckUtils]: 101: Hoare triple {354347#true} assume !(~ret~0 <= 0); {354347#true} is VALID [2022-04-08 08:55:59,480 INFO L290 TraceCheckUtils]: 102: Hoare triple {354347#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,480 INFO L290 TraceCheckUtils]: 103: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,481 INFO L290 TraceCheckUtils]: 104: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,482 INFO L290 TraceCheckUtils]: 107: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,482 INFO L290 TraceCheckUtils]: 109: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,483 INFO L290 TraceCheckUtils]: 110: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,483 INFO L290 TraceCheckUtils]: 111: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,483 INFO L290 TraceCheckUtils]: 112: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,484 INFO L290 TraceCheckUtils]: 113: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,484 INFO L290 TraceCheckUtils]: 114: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,484 INFO L290 TraceCheckUtils]: 115: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,485 INFO L290 TraceCheckUtils]: 116: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,485 INFO L290 TraceCheckUtils]: 117: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,485 INFO L290 TraceCheckUtils]: 118: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,486 INFO L290 TraceCheckUtils]: 119: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,486 INFO L290 TraceCheckUtils]: 120: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,486 INFO L290 TraceCheckUtils]: 121: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,487 INFO L290 TraceCheckUtils]: 122: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,487 INFO L290 TraceCheckUtils]: 123: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,488 INFO L290 TraceCheckUtils]: 124: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,488 INFO L290 TraceCheckUtils]: 125: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,488 INFO L290 TraceCheckUtils]: 126: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,489 INFO L290 TraceCheckUtils]: 127: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,489 INFO L290 TraceCheckUtils]: 128: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,490 INFO L290 TraceCheckUtils]: 129: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-08 08:55:59,490 INFO L290 TraceCheckUtils]: 130: Hoare triple {354352#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {354353#(not (= |ssl3_accept_#t~mem70| 8577))} is VALID [2022-04-08 08:55:59,490 INFO L290 TraceCheckUtils]: 131: Hoare triple {354353#(not (= |ssl3_accept_#t~mem70| 8577))} assume 8577 == #t~mem70;havoc #t~mem70; {354348#false} is VALID [2022-04-08 08:55:59,490 INFO L290 TraceCheckUtils]: 132: Hoare triple {354348#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {354348#false} is VALID [2022-04-08 08:55:59,490 INFO L290 TraceCheckUtils]: 133: Hoare triple {354348#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {354348#false} is VALID [2022-04-08 08:55:59,490 INFO L290 TraceCheckUtils]: 134: Hoare triple {354348#false} assume !(~ret~0 <= 0); {354348#false} is VALID [2022-04-08 08:55:59,490 INFO L290 TraceCheckUtils]: 135: Hoare triple {354348#false} assume 2 == ~ret~0;call write~int(8466, ~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 136: Hoare triple {354348#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 137: Hoare triple {354348#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 138: Hoare triple {354348#false} ~skip~0 := 0; {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 139: Hoare triple {354348#false} assume !false; {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 140: Hoare triple {354348#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 141: Hoare triple {354348#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 142: Hoare triple {354348#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 143: Hoare triple {354348#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 144: Hoare triple {354348#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 145: Hoare triple {354348#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 146: Hoare triple {354348#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 147: Hoare triple {354348#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 148: Hoare triple {354348#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 149: Hoare triple {354348#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,491 INFO L290 TraceCheckUtils]: 150: Hoare triple {354348#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 151: Hoare triple {354348#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 152: Hoare triple {354348#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 153: Hoare triple {354348#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 154: Hoare triple {354348#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 155: Hoare triple {354348#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 156: Hoare triple {354348#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 157: Hoare triple {354348#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 158: Hoare triple {354348#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 159: Hoare triple {354348#false} assume 8545 == #t~mem65;havoc #t~mem65; {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 160: Hoare triple {354348#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 161: Hoare triple {354348#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 162: Hoare triple {354348#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 163: Hoare triple {354348#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 164: Hoare triple {354348#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 165: Hoare triple {354348#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {354348#false} is VALID [2022-04-08 08:55:59,492 INFO L290 TraceCheckUtils]: 166: Hoare triple {354348#false} assume !(4 == ~blastFlag~0); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 167: Hoare triple {354348#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 168: Hoare triple {354348#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 169: Hoare triple {354348#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 170: Hoare triple {354348#false} ~skip~0 := 0; {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 171: Hoare triple {354348#false} assume !false; {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 172: Hoare triple {354348#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 173: Hoare triple {354348#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 174: Hoare triple {354348#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 175: Hoare triple {354348#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 176: Hoare triple {354348#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 177: Hoare triple {354348#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 178: Hoare triple {354348#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 179: Hoare triple {354348#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 180: Hoare triple {354348#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,493 INFO L290 TraceCheckUtils]: 181: Hoare triple {354348#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 182: Hoare triple {354348#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 183: Hoare triple {354348#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 184: Hoare triple {354348#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 185: Hoare triple {354348#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 186: Hoare triple {354348#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 187: Hoare triple {354348#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 188: Hoare triple {354348#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 189: Hoare triple {354348#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 190: Hoare triple {354348#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 191: Hoare triple {354348#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 192: Hoare triple {354348#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 193: Hoare triple {354348#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 194: Hoare triple {354348#false} assume 8448 == #t~mem68;havoc #t~mem68; {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 195: Hoare triple {354348#false} assume !(~num1~0 > 0); {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 196: Hoare triple {354348#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {354348#false} is VALID [2022-04-08 08:55:59,494 INFO L290 TraceCheckUtils]: 197: Hoare triple {354348#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 198: Hoare triple {354348#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 199: Hoare triple {354348#false} ~skip~0 := 0; {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 200: Hoare triple {354348#false} assume !false; {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 201: Hoare triple {354348#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 202: Hoare triple {354348#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 203: Hoare triple {354348#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 204: Hoare triple {354348#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 205: Hoare triple {354348#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 206: Hoare triple {354348#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 207: Hoare triple {354348#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 208: Hoare triple {354348#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 209: Hoare triple {354348#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 210: Hoare triple {354348#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 211: Hoare triple {354348#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,495 INFO L290 TraceCheckUtils]: 212: Hoare triple {354348#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 213: Hoare triple {354348#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 214: Hoare triple {354348#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 215: Hoare triple {354348#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 216: Hoare triple {354348#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 217: Hoare triple {354348#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 218: Hoare triple {354348#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 219: Hoare triple {354348#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 220: Hoare triple {354348#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 221: Hoare triple {354348#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 222: Hoare triple {354348#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 223: Hoare triple {354348#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 224: Hoare triple {354348#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 225: Hoare triple {354348#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 226: Hoare triple {354348#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 227: Hoare triple {354348#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,496 INFO L290 TraceCheckUtils]: 228: Hoare triple {354348#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,497 INFO L290 TraceCheckUtils]: 229: Hoare triple {354348#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {354348#false} is VALID [2022-04-08 08:55:59,497 INFO L290 TraceCheckUtils]: 230: Hoare triple {354348#false} assume 8640 == #t~mem75;havoc #t~mem75; {354348#false} is VALID [2022-04-08 08:55:59,497 INFO L290 TraceCheckUtils]: 231: Hoare triple {354348#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {354348#false} is VALID [2022-04-08 08:55:59,497 INFO L290 TraceCheckUtils]: 232: Hoare triple {354348#false} assume !(9 == ~blastFlag~0); {354348#false} is VALID [2022-04-08 08:55:59,497 INFO L290 TraceCheckUtils]: 233: Hoare triple {354348#false} assume 12 == ~blastFlag~0; {354348#false} is VALID [2022-04-08 08:55:59,497 INFO L290 TraceCheckUtils]: 234: Hoare triple {354348#false} assume !false; {354348#false} is VALID [2022-04-08 08:55:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-04-08 08:55:59,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:55:59,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051643356] [2022-04-08 08:55:59,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051643356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:59,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:59,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:59,498 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:55:59,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1222783216] [2022-04-08 08:55:59,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1222783216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:55:59,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:55:59,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:55:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533822166] [2022-04-08 08:55:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:55:59,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 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 235 [2022-04-08 08:55:59,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:55:59,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:55:59,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:55:59,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:55:59,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:55:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:55:59,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:55:59,592 INFO L87 Difference]: Start difference. First operand 2411 states and 3477 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:01,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:56:03,454 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:56:05,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:56:07,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:56:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:13,351 INFO L93 Difference]: Finished difference Result 5051 states and 7268 transitions. [2022-04-08 08:56:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:56:13,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 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 235 [2022-04-08 08:56:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:56:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:56:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-08 08:56:13,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-08 08:56:13,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:13,952 INFO L225 Difference]: With dead ends: 5051 [2022-04-08 08:56:13,952 INFO L226 Difference]: Without dead ends: 2668 [2022-04-08 08:56:13,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:56:13,954 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 117 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:56:13,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 408 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 475 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-04-08 08:56:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-04-08 08:56:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2411. [2022-04-08 08:56:14,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:56:14,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2668 states. Second operand has 2411 states, 2406 states have (on average 1.4334995843724023) internal successors, (3449), 2406 states have internal predecessors, (3449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:14,662 INFO L74 IsIncluded]: Start isIncluded. First operand 2668 states. Second operand has 2411 states, 2406 states have (on average 1.4334995843724023) internal successors, (3449), 2406 states have internal predecessors, (3449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:14,663 INFO L87 Difference]: Start difference. First operand 2668 states. Second operand has 2411 states, 2406 states have (on average 1.4334995843724023) internal successors, (3449), 2406 states have internal predecessors, (3449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:14,834 INFO L93 Difference]: Finished difference Result 2668 states and 3799 transitions. [2022-04-08 08:56:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3799 transitions. [2022-04-08 08:56:14,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:14,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:14,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 2411 states, 2406 states have (on average 1.4334995843724023) internal successors, (3449), 2406 states have internal predecessors, (3449), 3 states have call successors, (3), 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 2668 states. [2022-04-08 08:56:14,839 INFO L87 Difference]: Start difference. First operand has 2411 states, 2406 states have (on average 1.4334995843724023) internal successors, (3449), 2406 states have internal predecessors, (3449), 3 states have call successors, (3), 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 2668 states. [2022-04-08 08:56:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:56:15,006 INFO L93 Difference]: Finished difference Result 2668 states and 3799 transitions. [2022-04-08 08:56:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3799 transitions. [2022-04-08 08:56:15,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:56:15,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:56:15,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:56:15,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:56:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2406 states have (on average 1.4334995843724023) internal successors, (3449), 2406 states have internal predecessors, (3449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3453 transitions. [2022-04-08 08:56:15,224 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3453 transitions. Word has length 235 [2022-04-08 08:56:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:56:15,224 INFO L478 AbstractCegarLoop]: Abstraction has 2411 states and 3453 transitions. [2022-04-08 08:56:15,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:56:15,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2411 states and 3453 transitions. [2022-04-08 08:56:19,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3453 edges. 3453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:56:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3453 transitions. [2022-04-08 08:56:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-04-08 08:56:19,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:56:19,443 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2022-04-08 08:56:19,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-08 08:56:19,443 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:56:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:56:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash -920023613, now seen corresponding path program 1 times [2022-04-08 08:56:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:56:19,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219640365] [2022-04-08 08:56:32,429 WARN L232 SmtUtils]: Spent 10.36s on a formula simplification. DAG size of input: 280 DAG size of output: 223 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:56:48,703 WARN L232 SmtUtils]: Spent 10.13s on a formula simplification. DAG size of input: 277 DAG size of output: 223 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:57:03,029 WARN L232 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 279 DAG size of output: 225 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:57:16,554 WARN L232 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 282 DAG size of output: 225 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:57:22,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:57:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -920023613, now seen corresponding path program 2 times [2022-04-08 08:57:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:57:22,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398833388] [2022-04-08 08:57:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:57:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:57:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:57:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:57:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:57:22,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {374626#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {374619#true} is VALID [2022-04-08 08:57:22,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {374619#true} assume true; {374619#true} is VALID [2022-04-08 08:57:22,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {374619#true} {374619#true} #710#return; {374619#true} is VALID [2022-04-08 08:57:22,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {374619#true} call ULTIMATE.init(); {374626#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:57:22,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {374626#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base); {374619#true} is VALID [2022-04-08 08:57:22,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {374619#true} assume true; {374619#true} is VALID [2022-04-08 08:57:22,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {374619#true} {374619#true} #710#return; {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {374619#true} call #t~ret161 := main(); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {374619#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {374619#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L272 TraceCheckUtils]: 7: Hoare triple {374619#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {374619#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {374619#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {374619#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {374619#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {374619#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {374619#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {374619#true} assume !false; {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {374619#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {374619#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {374619#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {374619#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {374619#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {374619#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {374619#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {374619#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {374619#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {374619#true} assume 8464 == #t~mem55;havoc #t~mem55; {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {374619#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {374619#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {374619#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {374619#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {374619#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {374619#true} ~skip~0 := 0; {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {374619#true} assume !false; {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {374619#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {374619#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {374619#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {374619#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {374619#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {374619#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {374619#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {374619#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {374619#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {374619#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {374619#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {374619#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {374619#true} assume 8496 == #t~mem58;havoc #t~mem58; {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {374619#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {374619#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {374619#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {374619#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {374619#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {374619#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {374619#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {374619#true} ~skip~0 := 0; {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {374619#true} assume !false; {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {374619#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {374619#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {374619#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {374619#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {374619#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {374619#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {374619#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {374619#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {374619#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {374619#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,303 INFO L290 TraceCheckUtils]: 64: Hoare triple {374619#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {374619#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {374619#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {374619#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {374619#true} assume 8512 == #t~mem60;havoc #t~mem60; {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {374619#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {374619#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {374619#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {374619#true} assume !(~ret~0 <= 0); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {374619#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {374619#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {374619#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {374619#true} ~skip~0 := 0; {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {374619#true} assume !false; {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {374619#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,304 INFO L290 TraceCheckUtils]: 79: Hoare triple {374619#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {374619#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 81: Hoare triple {374619#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 82: Hoare triple {374619#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 83: Hoare triple {374619#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 84: Hoare triple {374619#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 85: Hoare triple {374619#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 86: Hoare triple {374619#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 87: Hoare triple {374619#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {374619#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {374619#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {374619#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 91: Hoare triple {374619#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 92: Hoare triple {374619#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {374619#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {374619#true} assume 8528 == #t~mem62;havoc #t~mem62; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 95: Hoare triple {374619#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 96: Hoare triple {374619#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {374619#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 98: Hoare triple {374619#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {374619#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {374619#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 101: Hoare triple {374619#true} assume !(~ret~0 <= 0); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 102: Hoare triple {374619#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 103: Hoare triple {374619#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 104: Hoare triple {374619#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 105: Hoare triple {374619#true} ~skip~0 := 0; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 106: Hoare triple {374619#true} assume !false; {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 107: Hoare triple {374619#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 108: Hoare triple {374619#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 109: Hoare triple {374619#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,306 INFO L290 TraceCheckUtils]: 110: Hoare triple {374619#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 111: Hoare triple {374619#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 112: Hoare triple {374619#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 113: Hoare triple {374619#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 114: Hoare triple {374619#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 115: Hoare triple {374619#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 116: Hoare triple {374619#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 117: Hoare triple {374619#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 118: Hoare triple {374619#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 119: Hoare triple {374619#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {374619#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 121: Hoare triple {374619#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 122: Hoare triple {374619#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 123: Hoare triple {374619#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 124: Hoare triple {374619#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,307 INFO L290 TraceCheckUtils]: 125: Hoare triple {374619#true} assume 8544 == #t~mem64;havoc #t~mem64; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 126: Hoare triple {374619#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 127: Hoare triple {374619#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 128: Hoare triple {374619#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 129: Hoare triple {374619#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 130: Hoare triple {374619#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 131: Hoare triple {374619#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 132: Hoare triple {374619#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 133: Hoare triple {374619#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 134: Hoare triple {374619#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 135: Hoare triple {374619#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 136: Hoare triple {374619#true} ~skip~0 := 0; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 137: Hoare triple {374619#true} assume !false; {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 138: Hoare triple {374619#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 139: Hoare triple {374619#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,308 INFO L290 TraceCheckUtils]: 140: Hoare triple {374619#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 141: Hoare triple {374619#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 142: Hoare triple {374619#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 143: Hoare triple {374619#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 144: Hoare triple {374619#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 145: Hoare triple {374619#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 146: Hoare triple {374619#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 147: Hoare triple {374619#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 148: Hoare triple {374619#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 149: Hoare triple {374619#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 150: Hoare triple {374619#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 151: Hoare triple {374619#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 152: Hoare triple {374619#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 153: Hoare triple {374619#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 154: Hoare triple {374619#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,309 INFO L290 TraceCheckUtils]: 155: Hoare triple {374619#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 156: Hoare triple {374619#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 157: Hoare triple {374619#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 158: Hoare triple {374619#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 159: Hoare triple {374619#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 160: Hoare triple {374619#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 161: Hoare triple {374619#true} assume 8576 == #t~mem69;havoc #t~mem69; {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 162: Hoare triple {374619#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 163: Hoare triple {374619#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {374619#true} is VALID [2022-04-08 08:57:22,310 INFO L290 TraceCheckUtils]: 164: Hoare triple {374619#true} assume !(~ret~0 <= 0); {374619#true} is VALID [2022-04-08 08:57:22,311 INFO L290 TraceCheckUtils]: 165: Hoare triple {374619#true} assume 2 == ~ret~0;call write~int(8466, ~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,311 INFO L290 TraceCheckUtils]: 166: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,312 INFO L290 TraceCheckUtils]: 167: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,312 INFO L290 TraceCheckUtils]: 168: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,312 INFO L290 TraceCheckUtils]: 169: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,313 INFO L290 TraceCheckUtils]: 170: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,313 INFO L290 TraceCheckUtils]: 171: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,314 INFO L290 TraceCheckUtils]: 172: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,314 INFO L290 TraceCheckUtils]: 173: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,314 INFO L290 TraceCheckUtils]: 174: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,315 INFO L290 TraceCheckUtils]: 175: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,315 INFO L290 TraceCheckUtils]: 176: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,316 INFO L290 TraceCheckUtils]: 177: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,316 INFO L290 TraceCheckUtils]: 178: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,316 INFO L290 TraceCheckUtils]: 179: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 180: Hoare triple {374624#(= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374625#(= 8466 |ssl3_accept_#t~mem57|)} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 181: Hoare triple {374625#(= 8466 |ssl3_accept_#t~mem57|)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 182: Hoare triple {374620#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 183: Hoare triple {374620#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 184: Hoare triple {374620#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 185: Hoare triple {374620#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 186: Hoare triple {374620#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,317 INFO L290 TraceCheckUtils]: 187: Hoare triple {374620#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 188: Hoare triple {374620#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 189: Hoare triple {374620#false} assume 8545 == #t~mem65;havoc #t~mem65; {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 190: Hoare triple {374620#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 191: Hoare triple {374620#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 192: Hoare triple {374620#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 193: Hoare triple {374620#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 194: Hoare triple {374620#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 195: Hoare triple {374620#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 196: Hoare triple {374620#false} assume !(4 == ~blastFlag~0); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 197: Hoare triple {374620#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 198: Hoare triple {374620#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 199: Hoare triple {374620#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 200: Hoare triple {374620#false} ~skip~0 := 0; {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 201: Hoare triple {374620#false} assume !false; {374620#false} is VALID [2022-04-08 08:57:22,318 INFO L290 TraceCheckUtils]: 202: Hoare triple {374620#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 203: Hoare triple {374620#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 204: Hoare triple {374620#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 205: Hoare triple {374620#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 206: Hoare triple {374620#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 207: Hoare triple {374620#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 208: Hoare triple {374620#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 209: Hoare triple {374620#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 210: Hoare triple {374620#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 211: Hoare triple {374620#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 212: Hoare triple {374620#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 213: Hoare triple {374620#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 214: Hoare triple {374620#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 215: Hoare triple {374620#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 216: Hoare triple {374620#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,319 INFO L290 TraceCheckUtils]: 217: Hoare triple {374620#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 218: Hoare triple {374620#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 219: Hoare triple {374620#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 220: Hoare triple {374620#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 221: Hoare triple {374620#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 222: Hoare triple {374620#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 223: Hoare triple {374620#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 224: Hoare triple {374620#false} assume 8448 == #t~mem68;havoc #t~mem68; {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 225: Hoare triple {374620#false} assume !(~num1~0 > 0); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 226: Hoare triple {374620#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 227: Hoare triple {374620#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 228: Hoare triple {374620#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 229: Hoare triple {374620#false} ~skip~0 := 0; {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 230: Hoare triple {374620#false} assume !false; {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 231: Hoare triple {374620#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 232: Hoare triple {374620#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,320 INFO L290 TraceCheckUtils]: 233: Hoare triple {374620#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 234: Hoare triple {374620#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 235: Hoare triple {374620#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 236: Hoare triple {374620#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 237: Hoare triple {374620#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 238: Hoare triple {374620#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 239: Hoare triple {374620#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 240: Hoare triple {374620#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 241: Hoare triple {374620#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 242: Hoare triple {374620#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 243: Hoare triple {374620#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 244: Hoare triple {374620#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 245: Hoare triple {374620#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 246: Hoare triple {374620#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 247: Hoare triple {374620#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,321 INFO L290 TraceCheckUtils]: 248: Hoare triple {374620#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 249: Hoare triple {374620#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 250: Hoare triple {374620#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 251: Hoare triple {374620#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 252: Hoare triple {374620#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 253: Hoare triple {374620#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 254: Hoare triple {374620#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 255: Hoare triple {374620#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 256: Hoare triple {374620#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 257: Hoare triple {374620#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 258: Hoare triple {374620#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 259: Hoare triple {374620#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 260: Hoare triple {374620#false} assume 8640 == #t~mem75;havoc #t~mem75; {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 261: Hoare triple {374620#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 262: Hoare triple {374620#false} assume !(9 == ~blastFlag~0); {374620#false} is VALID [2022-04-08 08:57:22,322 INFO L290 TraceCheckUtils]: 263: Hoare triple {374620#false} assume 12 == ~blastFlag~0; {374620#false} is VALID [2022-04-08 08:57:22,323 INFO L290 TraceCheckUtils]: 264: Hoare triple {374620#false} assume !false; {374620#false} is VALID [2022-04-08 08:57:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-08 08:57:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:57:22,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398833388] [2022-04-08 08:57:22,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398833388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:57:22,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:57:22,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:57:22,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:57:22,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219640365] [2022-04-08 08:57:22,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219640365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:57:22,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:57:22,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:57:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452460241] [2022-04-08 08:57:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:57:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 265 [2022-04-08 08:57:22,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:57:22,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:22,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:57:22,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:57:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:57:22,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:57:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:57:22,421 INFO L87 Difference]: Start difference. First operand 2411 states and 3453 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:32,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:57:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:37,784 INFO L93 Difference]: Finished difference Result 4891 states and 7005 transitions. [2022-04-08 08:57:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:57:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 265 [2022-04-08 08:57:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:57:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 08:57:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 456 transitions. [2022-04-08 08:57:37,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 456 transitions. [2022-04-08 08:57:38,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:57:38,329 INFO L225 Difference]: With dead ends: 4891 [2022-04-08 08:57:38,329 INFO L226 Difference]: Without dead ends: 2508 [2022-04-08 08:57:38,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:57:38,332 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 14 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:57:38,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 583 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 08:57:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2022-04-08 08:57:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2495. [2022-04-08 08:57:39,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:57:39,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2508 states. Second operand has 2495 states, 2490 states have (on average 1.430120481927711) internal successors, (3561), 2490 states have internal predecessors, (3561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:39,283 INFO L74 IsIncluded]: Start isIncluded. First operand 2508 states. Second operand has 2495 states, 2490 states have (on average 1.430120481927711) internal successors, (3561), 2490 states have internal predecessors, (3561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:39,284 INFO L87 Difference]: Start difference. First operand 2508 states. Second operand has 2495 states, 2490 states have (on average 1.430120481927711) internal successors, (3561), 2490 states have internal predecessors, (3561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:39,439 INFO L93 Difference]: Finished difference Result 2508 states and 3580 transitions. [2022-04-08 08:57:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3580 transitions. [2022-04-08 08:57:39,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:57:39,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:57:39,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 2495 states, 2490 states have (on average 1.430120481927711) internal successors, (3561), 2490 states have internal predecessors, (3561), 3 states have call successors, (3), 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 2508 states. [2022-04-08 08:57:39,443 INFO L87 Difference]: Start difference. First operand has 2495 states, 2490 states have (on average 1.430120481927711) internal successors, (3561), 2490 states have internal predecessors, (3561), 3 states have call successors, (3), 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 2508 states. [2022-04-08 08:57:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:57:39,590 INFO L93 Difference]: Finished difference Result 2508 states and 3580 transitions. [2022-04-08 08:57:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 3580 transitions. [2022-04-08 08:57:39,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:57:39,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:57:39,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:57:39,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:57:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2490 states have (on average 1.430120481927711) internal successors, (3561), 2490 states have internal predecessors, (3561), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3565 transitions. [2022-04-08 08:57:39,828 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3565 transitions. Word has length 265 [2022-04-08 08:57:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:57:39,829 INFO L478 AbstractCegarLoop]: Abstraction has 2495 states and 3565 transitions. [2022-04-08 08:57:39,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:57:39,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2495 states and 3565 transitions. [2022-04-08 08:57:43,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3565 edges. 3565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:57:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3565 transitions. [2022-04-08 08:57:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-04-08 08:57:43,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:57:43,458 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:57:43,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-08 08:57:43,458 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:57:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:57:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2008212711, now seen corresponding path program 1 times [2022-04-08 08:57:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:57:43,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55156479] [2022-04-08 08:57:55,461 WARN L232 SmtUtils]: Spent 10.44s on a formula simplification. DAG size of input: 280 DAG size of output: 223 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:58:12,412 WARN L232 SmtUtils]: Spent 10.72s on a formula simplification. DAG size of input: 277 DAG size of output: 223 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)