/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-e106359-m [2022-04-15 11:44:02,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:44:02,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:44:02,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:44:02,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:44:02,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:44:02,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:44:02,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:44:02,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:44:02,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:44:02,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:44:02,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:44:02,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:44:02,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:44:02,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:44:02,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:44:02,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:44:02,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:44:02,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:44:02,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:44:02,925 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:44:02,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:44:02,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:44:02,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:44:02,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:44:02,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:44:02,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:44:02,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:44:02,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:44:02,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:44:02,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:44:02,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:44:02,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:44:02,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:44:02,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:44:02,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:44:02,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:44:02,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:44:02,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:44:02,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:44:02,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:44:02,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:44:02,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:44:02,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:44:02,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:44:02,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:44:02,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:44:02,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:44:02,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:44:02,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:44:02,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:44:02,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:44:02,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:44:02,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:44:02,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:44:02,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:44:02,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:44:02,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:44:02,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:44:02,953 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:44:02,954 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:44:03,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:44:03,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:44:03,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:44:03,150 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:44:03,150 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:44:03,151 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-15 11:44:03,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24aaaaf6/90e57542fbcd4469b624d853b6d7b979/FLAG27f23d261 [2022-04-15 11:44:03,598 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:44:03,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-2.c [2022-04-15 11:44:03,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24aaaaf6/90e57542fbcd4469b624d853b6d7b979/FLAG27f23d261 [2022-04-15 11:44:03,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24aaaaf6/90e57542fbcd4469b624d853b6d7b979 [2022-04-15 11:44:03,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:44:03,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:44:03,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:44:03,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:44:03,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:44:03,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:44:03" (1/1) ... [2022-04-15 11:44:03,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dbb1e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:03, skipping insertion in model container [2022-04-15 11:44:03,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:44:03" (1/1) ... [2022-04-15 11:44:03,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:44:04,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:44:04,290 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-15 11:44:04,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:44:04,307 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:44:04,390 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-15 11:44:04,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:44:04,404 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:44:04,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04 WrapperNode [2022-04-15 11:44:04,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:44:04,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:44:04,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:44:04,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:44:04,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:44:04,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:44:04,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:44:04,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:44:04,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (1/1) ... [2022-04-15 11:44:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:44:04,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:44:04,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:44:04,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:44:04,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:44:04,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:44:04,528 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:44:04,528 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:44:04,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:44:04,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:44:04,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:44:04,669 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:44:04,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:44:05,410 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:44:05,903 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:44:05,904 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:44:05,914 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:44:05,924 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:44:05,924 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:44:05,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:44:05 BoogieIcfgContainer [2022-04-15 11:44:05,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:44:05,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:44:05,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:44:05,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:44:05,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:44:03" (1/3) ... [2022-04-15 11:44:05,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35503023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:44:05, skipping insertion in model container [2022-04-15 11:44:05,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:44:04" (2/3) ... [2022-04-15 11:44:05,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35503023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:44:05, skipping insertion in model container [2022-04-15 11:44:05,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:44:05" (3/3) ... [2022-04-15 11:44:05,934 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2022-04-15 11:44:05,940 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:44:05,940 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:44:05,971 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:44:05,982 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:44:05,982 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:44:06,001 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-15 11:44:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 11:44:06,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:06,012 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-15 11:44:06,013 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1074581461, now seen corresponding path program 1 times [2022-04-15 11:44:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:06,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330406033] [2022-04-15 11:44:06,030 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:44:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1074581461, now seen corresponding path program 2 times [2022-04-15 11:44:06,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:06,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975699569] [2022-04-15 11:44:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:06,490 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-15 11:44:06,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-15 11:44:06,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164#true} {164#true} #710#return; {164#true} is VALID [2022-04-15 11:44:06,492 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-15 11:44:06,492 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-15 11:44:06,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-15 11:44:06,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} #710#return; {164#true} is VALID [2022-04-15 11:44:06,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} call #t~ret161 := main(); {164#true} is VALID [2022-04-15 11:44:06,494 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-15 11:44:06,494 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-15 11:44:06,494 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-15 11:44:06,500 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-15 11:44:06,501 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-15 11:44:06,502 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-15 11:44:06,502 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-15 11:44:06,503 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-15 11:44:06,504 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-15 11:44:06,504 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-15 11:44:06,505 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-15 11:44:06,506 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-15 11:44:06,507 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-15 11:44:06,508 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-15 11:44:06,508 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-15 11:44:06,509 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-15 11:44:06,509 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-15 11:44:06,510 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-15 11:44:06,511 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-15 11:44:06,511 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-15 11:44:06,512 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-15 11:44:06,513 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-15 11:44:06,514 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-15 11:44:06,515 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-15 11:44:06,516 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-15 11:44:06,516 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-15 11:44:06,517 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-15 11:44:06,517 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-15 11:44:06,518 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-15 11:44:06,518 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-15 11:44:06,519 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-15 11:44:06,521 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-15 11:44:06,522 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-15 11:44:06,522 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-15 11:44:06,523 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-15 11:44:06,523 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-15 11:44:06,524 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-15 11:44:06,525 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-15 11:44:06,526 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-15 11:44:06,526 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-15 11:44:06,526 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-15 11:44:06,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#false} assume !(9 == ~blastFlag~0); {165#false} is VALID [2022-04-15 11:44:06,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#false} assume 12 == ~blastFlag~0; {165#false} is VALID [2022-04-15 11:44:06,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-04-15 11:44:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:06,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:06,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975699569] [2022-04-15 11:44:06,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975699569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:06,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:06,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:06,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330406033] [2022-04-15 11:44:06,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330406033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:06,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:06,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953949170] [2022-04-15 11:44:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:06,548 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-15 11:44:06,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:06,552 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-15 11:44:06,602 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-15 11:44:06,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:06,635 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-15 11:44:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:10,419 INFO L93 Difference]: Finished difference Result 440 states and 746 transitions. [2022-04-15 11:44:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:10,420 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-15 11:44:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:10,421 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-15 11:44:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2022-04-15 11:44:10,432 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-15 11:44:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2022-04-15 11:44:10,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 746 transitions. [2022-04-15 11:44:10,942 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-15 11:44:10,964 INFO L225 Difference]: With dead ends: 440 [2022-04-15 11:44:10,964 INFO L226 Difference]: Without dead ends: 268 [2022-04-15 11:44:10,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:10,973 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-15 11:44:10,974 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-15 11:44:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-15 11:44:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 185. [2022-04-15 11:44:11,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:11,020 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-15 11:44:11,021 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-15 11:44:11,022 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-15 11:44:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:11,033 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2022-04-15 11:44:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-04-15 11:44:11,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:11,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:11,040 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-15 11:44:11,041 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-15 11:44:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:11,050 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2022-04-15 11:44:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-04-15 11:44:11,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:11,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:11,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:11,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:11,052 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-15 11:44:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 294 transitions. [2022-04-15 11:44:11,059 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 294 transitions. Word has length 49 [2022-04-15 11:44:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:11,059 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 294 transitions. [2022-04-15 11:44:11,060 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-15 11:44:11,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 294 transitions. [2022-04-15 11:44:11,261 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-15 11:44:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 294 transitions. [2022-04-15 11:44:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 11:44:11,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:11,262 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-15 11:44:11,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:44:11,263 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1287983627, now seen corresponding path program 1 times [2022-04-15 11:44:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:11,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1407876133] [2022-04-15 11:44:11,264 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:44:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1287983627, now seen corresponding path program 2 times [2022-04-15 11:44:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:11,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372034462] [2022-04-15 11:44:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:11,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:11,419 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-15 11:44:11,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {1962#true} assume true; {1962#true} is VALID [2022-04-15 11:44:11,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1962#true} {1962#true} #710#return; {1962#true} is VALID [2022-04-15 11:44:11,421 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-15 11:44:11,421 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-15 11:44:11,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {1962#true} assume true; {1962#true} is VALID [2022-04-15 11:44:11,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1962#true} {1962#true} #710#return; {1962#true} is VALID [2022-04-15 11:44:11,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {1962#true} call #t~ret161 := main(); {1962#true} is VALID [2022-04-15 11:44:11,421 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-15 11:44:11,421 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-15 11:44:11,421 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-15 11:44:11,424 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-15 11:44:11,424 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-15 11:44:11,425 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-15 11:44:11,426 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-15 11:44:11,426 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-15 11:44:11,426 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-15 11:44:11,427 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-15 11:44:11,428 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-15 11:44:11,428 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-15 11:44:11,428 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-15 11:44:11,429 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-15 11:44:11,429 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-15 11:44:11,429 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-15 11:44:11,430 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-15 11:44:11,430 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-15 11:44:11,431 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-15 11:44:11,431 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-15 11:44:11,431 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-15 11:44:11,431 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-15 11:44:11,431 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-15 11:44:11,431 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,432 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-15 11:44:11,433 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-15 11:44:11,433 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-15 11:44:11,433 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-15 11:44:11,433 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-15 11:44:11,433 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-15 11:44:11,433 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-15 11:44:11,433 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-15 11:44:11,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {1963#false} assume 8641 == #t~mem76;havoc #t~mem76; {1963#false} is VALID [2022-04-15 11:44:11,434 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-15 11:44:11,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {1963#false} assume !(9 == ~blastFlag~0); {1963#false} is VALID [2022-04-15 11:44:11,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {1963#false} assume 12 == ~blastFlag~0; {1963#false} is VALID [2022-04-15 11:44:11,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {1963#false} assume !false; {1963#false} is VALID [2022-04-15 11:44:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:11,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:11,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372034462] [2022-04-15 11:44:11,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372034462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:11,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:11,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:11,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:11,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1407876133] [2022-04-15 11:44:11,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1407876133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:11,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:11,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:11,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594675992] [2022-04-15 11:44:11,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:11,436 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-15 11:44:11,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:11,436 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-15 11:44:11,467 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-15 11:44:11,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:11,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:11,469 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-15 11:44:13,939 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-15 11:44:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:20,349 INFO L93 Difference]: Finished difference Result 383 states and 610 transitions. [2022-04-15 11:44:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:20,349 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-15 11:44:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:20,350 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-15 11:44:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-15 11:44:20,353 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-15 11:44:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-15 11:44:20,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-15 11:44:20,640 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-15 11:44:20,643 INFO L225 Difference]: With dead ends: 383 [2022-04-15 11:44:20,643 INFO L226 Difference]: Without dead ends: 213 [2022-04-15 11:44:20,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:20,645 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:20,645 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.8s Time] [2022-04-15 11:44:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-15 11:44:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-04-15 11:44:20,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:20,654 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-15 11:44:20,669 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-15 11:44:20,670 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-15 11:44:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:20,674 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2022-04-15 11:44:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-15 11:44:20,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:20,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:20,676 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-15 11:44:20,676 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-15 11:44:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:20,681 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2022-04-15 11:44:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-15 11:44:20,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:20,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:20,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:20,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:20,682 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-15 11:44:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 313 transitions. [2022-04-15 11:44:20,687 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 313 transitions. Word has length 50 [2022-04-15 11:44:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:20,688 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 313 transitions. [2022-04-15 11:44:20,688 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-15 11:44:20,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 313 transitions. [2022-04-15 11:44:20,889 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-15 11:44:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 313 transitions. [2022-04-15 11:44:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:44:20,890 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:20,891 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-15 11:44:20,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:44:20,891 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 41561780, now seen corresponding path program 1 times [2022-04-15 11:44:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:20,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397487781] [2022-04-15 11:44:20,931 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:20,931 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:20,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 41561780, now seen corresponding path program 2 times [2022-04-15 11:44:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:20,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969270406] [2022-04-15 11:44:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:21,152 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-15 11:44:21,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-15 11:44:21,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3558#true} {3558#true} #710#return; {3558#true} is VALID [2022-04-15 11:44:21,153 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-15 11:44:21,154 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-15 11:44:21,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-15 11:44:21,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #710#return; {3558#true} is VALID [2022-04-15 11:44:21,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret161 := main(); {3558#true} is VALID [2022-04-15 11:44:21,154 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-15 11:44:21,154 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-15 11:44:21,154 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-15 11:44:21,156 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-15 11:44:21,157 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-15 11:44:21,158 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-15 11:44:21,158 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-15 11:44:21,159 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-15 11:44:21,159 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-15 11:44:21,159 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-15 11:44:21,160 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-15 11:44:21,160 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-15 11:44:21,161 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-15 11:44:21,161 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-15 11:44:21,161 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-15 11:44:21,162 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-15 11:44:21,162 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-15 11:44:21,162 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-15 11:44:21,163 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-15 11:44:21,163 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-15 11:44:21,163 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-15 11:44:21,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {3559#false} ~skip~0 := 0; {3559#false} is VALID [2022-04-15 11:44:21,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-15 11:44:21,163 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-15 11:44:21,163 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-15 11:44:21,163 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-15 11:44:21,163 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-15 11:44:21,164 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-15 11:44:21,164 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-15 11:44:21,164 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-15 11:44:21,164 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-15 11:44:21,164 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-15 11:44:21,164 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-15 11:44:21,164 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-15 11:44:21,164 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,165 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-15 11:44:21,166 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-15 11:44:21,166 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-15 11:44:21,166 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-15 11:44:21,166 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-15 11:44:21,166 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-15 11:44:21,166 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-15 11:44:21,166 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-15 11:44:21,166 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-15 11:44:21,167 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-15 11:44:21,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {3559#false} assume 8641 == #t~mem76;havoc #t~mem76; {3559#false} is VALID [2022-04-15 11:44:21,167 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-15 11:44:21,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {3559#false} assume !(9 == ~blastFlag~0); {3559#false} is VALID [2022-04-15 11:44:21,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {3559#false} assume 12 == ~blastFlag~0; {3559#false} is VALID [2022-04-15 11:44:21,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-15 11:44:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:21,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:21,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969270406] [2022-04-15 11:44:21,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969270406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:21,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:21,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:21,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:21,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397487781] [2022-04-15 11:44:21,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397487781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:21,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:21,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793326090] [2022-04-15 11:44:21,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:21,169 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-15 11:44:21,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:21,169 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-15 11:44:21,213 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-15 11:44:21,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:21,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:21,215 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-15 11:44:23,004 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-15 11:44:25,256 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-15 11:44:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:29,469 INFO L93 Difference]: Finished difference Result 383 states and 609 transitions. [2022-04-15 11:44:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:29,470 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-15 11:44:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:29,470 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-15 11:44:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:44:29,473 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-15 11:44:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-15 11:44:29,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-15 11:44:29,768 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-15 11:44:29,771 INFO L225 Difference]: With dead ends: 383 [2022-04-15 11:44:29,772 INFO L226 Difference]: Without dead ends: 213 [2022-04-15 11:44:29,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:29,773 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 24 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:29,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 501 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 11:44:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-15 11:44:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-04-15 11:44:29,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:29,781 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-15 11:44:29,781 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-15 11:44:29,782 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-15 11:44:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:29,786 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2022-04-15 11:44:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-15 11:44:29,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:29,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:29,787 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-15 11:44:29,787 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-15 11:44:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:29,792 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2022-04-15 11:44:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-15 11:44:29,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:29,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:29,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:29,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:29,793 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-15 11:44:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 312 transitions. [2022-04-15 11:44:29,796 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 312 transitions. Word has length 63 [2022-04-15 11:44:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:29,796 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 312 transitions. [2022-04-15 11:44:29,797 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-15 11:44:29,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 312 transitions. [2022-04-15 11:44:30,007 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-15 11:44:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 312 transitions. [2022-04-15 11:44:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 11:44:30,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:30,008 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-15 11:44:30,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:44:30,008 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash -674118940, now seen corresponding path program 1 times [2022-04-15 11:44:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:30,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910376007] [2022-04-15 11:44:30,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:30,027 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:30,027 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -674118940, now seen corresponding path program 2 times [2022-04-15 11:44:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:30,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348185997] [2022-04-15 11:44:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:30,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:30,142 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-15 11:44:30,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {5154#true} assume true; {5154#true} is VALID [2022-04-15 11:44:30,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5154#true} {5154#true} #710#return; {5154#true} is VALID [2022-04-15 11:44:30,143 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-15 11:44:30,143 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-15 11:44:30,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {5154#true} assume true; {5154#true} is VALID [2022-04-15 11:44:30,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5154#true} {5154#true} #710#return; {5154#true} is VALID [2022-04-15 11:44:30,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {5154#true} call #t~ret161 := main(); {5154#true} is VALID [2022-04-15 11:44:30,144 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-15 11:44:30,144 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-15 11:44:30,144 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-15 11:44:30,146 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-15 11:44:30,146 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-15 11:44:30,149 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-15 11:44:30,150 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-15 11:44:30,150 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-15 11:44:30,151 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-15 11:44:30,152 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-15 11:44:30,153 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-15 11:44:30,153 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-15 11:44:30,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {5155#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5155#false} is VALID [2022-04-15 11:44:30,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {5155#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5155#false} is VALID [2022-04-15 11:44:30,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {5155#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5155#false} is VALID [2022-04-15 11:44:30,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {5155#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5155#false} is VALID [2022-04-15 11:44:30,154 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-15 11:44:30,154 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-15 11:44:30,154 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-15 11:44:30,154 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-15 11:44:30,154 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-15 11:44:30,154 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-15 11:44:30,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {5155#false} ~skip~0 := 0; {5155#false} is VALID [2022-04-15 11:44:30,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {5155#false} assume !false; {5155#false} is VALID [2022-04-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,158 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,159 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,160 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-15 11:44:30,161 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-15 11:44:30,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {5155#false} assume 8641 == #t~mem76;havoc #t~mem76; {5155#false} is VALID [2022-04-15 11:44:30,161 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-15 11:44:30,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {5155#false} assume !(9 == ~blastFlag~0); {5155#false} is VALID [2022-04-15 11:44:30,161 INFO L290 TraceCheckUtils]: 62: Hoare triple {5155#false} assume 12 == ~blastFlag~0; {5155#false} is VALID [2022-04-15 11:44:30,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {5155#false} assume !false; {5155#false} is VALID [2022-04-15 11:44:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:30,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348185997] [2022-04-15 11:44:30,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348185997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:30,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:30,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:30,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:30,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910376007] [2022-04-15 11:44:30,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910376007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:30,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:30,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106888711] [2022-04-15 11:44:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:30,163 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-15 11:44:30,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:30,163 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-15 11:44:30,205 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-15 11:44:30,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:30,206 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-15 11:44:34,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:37,041 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-15 11:44:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:37,950 INFO L93 Difference]: Finished difference Result 382 states and 607 transitions. [2022-04-15 11:44:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:37,950 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-15 11:44:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:37,951 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-15 11:44:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:44:37,954 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-15 11:44:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:44:37,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-15 11:44:38,238 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-15 11:44:38,242 INFO L225 Difference]: With dead ends: 382 [2022-04-15 11:44:38,242 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 11:44:38,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:38,244 INFO L913 BasicCegarLoop]: 194 mSDtfsCounter, 28 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:38,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 503 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-15 11:44:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 11:44:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 196. [2022-04-15 11:44:38,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:38,253 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-15 11:44:38,253 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-15 11:44:38,253 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-15 11:44:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:38,257 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-15 11:44:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-15 11:44:38,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:38,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:38,257 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-15 11:44:38,258 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-15 11:44:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:38,261 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-15 11:44:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-15 11:44:38,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:38,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:38,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:38,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:38,262 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-15 11:44:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 311 transitions. [2022-04-15 11:44:38,265 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 311 transitions. Word has length 64 [2022-04-15 11:44:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:38,265 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 311 transitions. [2022-04-15 11:44:38,265 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-15 11:44:38,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 311 transitions. [2022-04-15 11:44:38,468 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-15 11:44:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 311 transitions. [2022-04-15 11:44:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 11:44:38,469 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:38,469 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-15 11:44:38,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:44:38,470 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1212784504, now seen corresponding path program 1 times [2022-04-15 11:44:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:38,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494034317] [2022-04-15 11:44:38,642 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:44:38,643 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:44:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1121925032, now seen corresponding path program 1 times [2022-04-15 11:44:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:38,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048400249] [2022-04-15 11:44:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:38,744 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-15 11:44:38,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {6746#true} assume true; {6746#true} is VALID [2022-04-15 11:44:38,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6746#true} {6746#true} #710#return; {6746#true} is VALID [2022-04-15 11:44:38,745 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-15 11:44:38,745 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-15 11:44:38,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {6746#true} assume true; {6746#true} is VALID [2022-04-15 11:44:38,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6746#true} {6746#true} #710#return; {6746#true} is VALID [2022-04-15 11:44:38,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {6746#true} call #t~ret161 := main(); {6746#true} is VALID [2022-04-15 11:44:38,745 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-15 11:44:38,745 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-15 11:44:38,745 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-15 11:44:38,747 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-15 11:44:38,747 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-15 11:44:38,747 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-15 11:44:38,748 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-15 11:44:38,749 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-15 11:44:38,749 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-15 11:44:38,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} [716] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.offset_262| |v_#memory_$Pointer$.offset_256|)) (.cse1 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse2 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse3 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse4 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse5 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse6 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse7 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse8 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse9 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse10 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse11 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse12 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|)) (.cse13 (= |v_#memory_$Pointer$.base_262| |v_#memory_$Pointer$.base_256|))) (or (and .cse0 .cse1 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_#memory_int_257| |v_#memory_int_262|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|) .cse13) (and .cse0 .cse1 .cse2 (= |v_#memory_int_262| |v_#memory_int_257|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_10| |v_ssl3_accept_#t~mem150.offset_8|) (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|) .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_262|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_10|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_10|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_12|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_6|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_16, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_262|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_262|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_8} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_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-15 11:44:38,752 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-15 11:44:38,752 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-15 11:44:38,753 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-15 11:44:38,753 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-15 11:44:38,753 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-15 11:44:38,753 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-15 11:44:38,755 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-15 11:44:38,755 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-15 11:44:38,755 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-15 11:44:38,755 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-15 11:44:38,756 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-15 11:44:38,756 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-15 11:44:38,756 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-15 11:44:38,757 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-15 11:44:38,757 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-15 11:44:38,757 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-15 11:44:38,757 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-15 11:44:38,758 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-15 11:44:38,758 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-15 11:44:38,758 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-15 11:44:38,758 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-15 11:44:38,759 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-15 11:44:38,759 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-15 11:44:38,759 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-15 11:44:38,760 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-15 11:44:38,760 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-15 11:44:38,760 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-15 11:44:38,760 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-15 11:44:38,761 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-15 11:44:38,761 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-15 11:44:38,761 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-15 11:44:38,761 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-15 11:44:38,762 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-15 11:44:38,762 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-15 11:44:38,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {6747#false} is VALID [2022-04-15 11:44:38,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {6747#false} assume !false; {6747#false} is VALID [2022-04-15 11:44:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:38,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048400249] [2022-04-15 11:44:38,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048400249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:38,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:38,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:44:41,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:41,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494034317] [2022-04-15 11:44:41,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494034317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:41,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:41,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:44:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346441088] [2022-04-15 11:44:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:41,599 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-15 11:44:41,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:41,599 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-15 11:44:41,658 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-15 11:44:41,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:44:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:44:41,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:44:41,659 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-15 11:44:43,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:45,835 INFO L93 Difference]: Finished difference Result 534 states and 861 transitions. [2022-04-15 11:44:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:44:45,835 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-15 11:44:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:45,835 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-15 11:44:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 625 transitions. [2022-04-15 11:44:45,838 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-15 11:44:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 625 transitions. [2022-04-15 11:44:45,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 625 transitions. [2022-04-15 11:44:46,234 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-15 11:44:46,240 INFO L225 Difference]: With dead ends: 534 [2022-04-15 11:44:46,240 INFO L226 Difference]: Without dead ends: 364 [2022-04-15 11:44:46,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:44:46,241 INFO L913 BasicCegarLoop]: 346 mSDtfsCounter, 148 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:46,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 927 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 720 Invalid, 1 Unknown, 227 Unchecked, 2.7s Time] [2022-04-15 11:44:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-15 11:44:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 359. [2022-04-15 11:44:46,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:46,254 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-15 11:44:46,255 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-15 11:44:46,255 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-15 11:44:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:46,261 INFO L93 Difference]: Finished difference Result 364 states and 572 transitions. [2022-04-15 11:44:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 572 transitions. [2022-04-15 11:44:46,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:46,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:46,263 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-15 11:44:46,263 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-15 11:44:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:46,269 INFO L93 Difference]: Finished difference Result 364 states and 572 transitions. [2022-04-15 11:44:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 572 transitions. [2022-04-15 11:44:46,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:46,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:46,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:46,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:46,271 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-15 11:44:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 566 transitions. [2022-04-15 11:44:46,278 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 566 transitions. Word has length 64 [2022-04-15 11:44:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:46,278 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 566 transitions. [2022-04-15 11:44:46,278 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-15 11:44:46,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 566 transitions. [2022-04-15 11:44:46,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 566 transitions. [2022-04-15 11:44:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 11:44:46,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:46,664 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-15 11:44:46,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:44:46,664 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2106270842, now seen corresponding path program 1 times [2022-04-15 11:44:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:46,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599353352] [2022-04-15 11:44:46,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:44:46,790 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:44:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash -856760296, now seen corresponding path program 1 times [2022-04-15 11:44:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:46,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994266162] [2022-04-15 11:44:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:46,903 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-15 11:44:46,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {9278#true} assume true; {9278#true} is VALID [2022-04-15 11:44:46,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9278#true} {9278#true} #710#return; {9278#true} is VALID [2022-04-15 11:44:46,905 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-15 11:44:46,905 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-15 11:44:46,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {9278#true} assume true; {9278#true} is VALID [2022-04-15 11:44:46,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9278#true} {9278#true} #710#return; {9278#true} is VALID [2022-04-15 11:44:46,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {9278#true} call #t~ret161 := main(); {9278#true} is VALID [2022-04-15 11:44:46,905 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-15 11:44:46,905 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-15 11:44:46,905 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-15 11:44:46,906 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-15 11:44:46,907 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-15 11:44:46,908 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-15 11:44:46,908 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-15 11:44:46,908 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-15 11:44:46,908 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-15 11:44:46,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} [718] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_10| |v_ssl3_accept_#t~mem88.offset_9|)) (.cse1 (= |v_#memory_$Pointer$.base_282| |v_#memory_$Pointer$.base_276|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_16| |v_ssl3_accept_#t~mem150.offset_14|)) (.cse3 (= v_ssl3_accept_~skip~0_21 v_ssl3_accept_~skip~0_20)) (.cse4 (= |v_ssl3_accept_#t~mem82_17| |v_ssl3_accept_#t~mem82_15|)) (.cse5 (= |v_ssl3_accept_#t~mem151_18| |v_ssl3_accept_#t~mem151_16|)) (.cse6 (= |v_ssl3_accept_#t~mem47_19| |v_ssl3_accept_#t~mem47_17|)) (.cse7 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_15|)) (.cse8 (= |v_ssl3_accept_#t~mem85_17| |v_ssl3_accept_#t~mem85_15|)) (.cse9 (= v_ssl3_accept_~state~0_13 v_ssl3_accept_~state~0_12)) (.cse10 (= |v_#memory_$Pointer$.offset_282| |v_#memory_$Pointer$.offset_276|)) (.cse11 (= |v_ssl3_accept_#t~mem89_10| |v_ssl3_accept_#t~mem89_9|)) (.cse12 (= |v_ssl3_accept_#t~mem150.base_16| |v_ssl3_accept_#t~mem150.base_14|)) (.cse13 (= |v_ssl3_accept_#t~mem46_11| |v_ssl3_accept_#t~mem46_10|)) (.cse14 (= |v_#memory_int_281| |v_#memory_int_276|))) (or (and .cse0 .cse1 (= |v_ssl3_accept_#t~mem88.base_9| |v_ssl3_accept_#t~mem88.base_10|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem48_15| |v_ssl3_accept_#t~mem48_17|) .cse13 (= |v_ssl3_accept_#t~mem83.base_15| |v_ssl3_accept_#t~mem83.base_17|) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem83.base_17| |v_ssl3_accept_#t~mem83.base_15|) .cse5 (= |v_ssl3_accept_#t~mem48_17| |v_ssl3_accept_#t~mem48_15|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_9|) .cse11 .cse12 .cse13 .cse14))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_282|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_17|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_17|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_17|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_19|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_11|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_21, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_281|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_282|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_13} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_15|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_15|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_15|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_16|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_9|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_15|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_17|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_20, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_9|, #memory_int=|v_#memory_int_276|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_12} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {9283#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:44:46,909 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-15 11:44:46,909 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-15 11:44:46,910 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-15 11:44:46,910 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-15 11:44:46,910 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-15 11:44:46,911 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-15 11:44:46,911 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-15 11:44:46,911 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-15 11:44:46,911 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-15 11:44:46,912 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-15 11:44:46,912 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-15 11:44:46,912 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-15 11:44:46,913 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-15 11:44:46,913 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-15 11:44:46,913 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-15 11:44:46,913 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-15 11:44:46,914 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-15 11:44:46,914 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-15 11:44:46,914 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-15 11:44:46,914 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-15 11:44:46,915 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-15 11:44:46,915 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-15 11:44:46,915 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-15 11:44:46,916 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-15 11:44:46,916 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-15 11:44:46,916 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-15 11:44:46,916 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-15 11:44:46,921 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-15 11:44:46,921 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-15 11:44:46,922 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-15 11:44:46,922 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-15 11:44:46,922 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-15 11:44:46,923 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-15 11:44:46,923 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-15 11:44:46,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {9279#false} is VALID [2022-04-15 11:44:46,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {9279#false} assume !false; {9279#false} is VALID [2022-04-15 11:44:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:44:46,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:46,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994266162] [2022-04-15 11:44:46,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994266162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:46,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:46,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:44:49,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:49,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599353352] [2022-04-15 11:44:49,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599353352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:49,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:49,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:44:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653596517] [2022-04-15 11:44:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:49,815 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-15 11:44:49,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:49,815 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-15 11:44:49,872 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-15 11:44:49,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:44:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:44:49,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:44:49,873 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-15 11:44:55,230 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-15 11:45:01,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:02,997 INFO L93 Difference]: Finished difference Result 538 states and 853 transitions. [2022-04-15 11:45:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:45:02,998 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-15 11:45:02,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:02,998 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-15 11:45:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-15 11:45:03,001 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-15 11:45:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-15 11:45:03,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 612 transitions. [2022-04-15 11:45:03,418 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-15 11:45:03,425 INFO L225 Difference]: With dead ends: 538 [2022-04-15 11:45:03,425 INFO L226 Difference]: Without dead ends: 368 [2022-04-15 11:45:03,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:45:03,426 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 148 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:03,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 821 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 537 Invalid, 1 Unknown, 364 Unchecked, 6.5s Time] [2022-04-15 11:45:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-15 11:45:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 359. [2022-04-15 11:45:03,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:03,436 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-15 11:45:03,437 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-15 11:45:03,437 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-15 11:45:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:03,443 INFO L93 Difference]: Finished difference Result 368 states and 577 transitions. [2022-04-15 11:45:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 577 transitions. [2022-04-15 11:45:03,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:03,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:03,444 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-15 11:45:03,445 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-15 11:45:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:03,451 INFO L93 Difference]: Finished difference Result 368 states and 577 transitions. [2022-04-15 11:45:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 577 transitions. [2022-04-15 11:45:03,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:03,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:03,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:03,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:03,452 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-15 11:45:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 566 transitions. [2022-04-15 11:45:03,459 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 566 transitions. Word has length 64 [2022-04-15 11:45:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:03,459 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 566 transitions. [2022-04-15 11:45:03,459 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-15 11:45:03,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 566 transitions. [2022-04-15 11:45:03,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 566 transitions. [2022-04-15 11:45:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:45:03,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:03,866 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-15 11:45:03,866 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:45:03,866 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1071065521, now seen corresponding path program 1 times [2022-04-15 11:45:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:03,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335165699] [2022-04-15 11:45:03,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:03,883 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:03,883 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1071065521, now seen corresponding path program 2 times [2022-04-15 11:45:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297526607] [2022-04-15 11:45:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:04,014 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-15 11:45:04,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {11826#true} assume true; {11826#true} is VALID [2022-04-15 11:45:04,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11826#true} {11826#true} #710#return; {11826#true} is VALID [2022-04-15 11:45:04,015 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-15 11:45:04,015 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-15 11:45:04,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {11826#true} assume true; {11826#true} is VALID [2022-04-15 11:45:04,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11826#true} {11826#true} #710#return; {11826#true} is VALID [2022-04-15 11:45:04,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {11826#true} call #t~ret161 := main(); {11826#true} is VALID [2022-04-15 11:45:04,015 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-15 11:45:04,015 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-15 11:45:04,015 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-15 11:45:04,017 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-15 11:45:04,017 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-15 11:45:04,018 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-15 11:45:04,018 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-15 11:45:04,019 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-15 11:45:04,019 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-15 11:45:04,019 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-15 11:45:04,020 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-15 11:45:04,021 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-15 11:45:04,021 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-15 11:45:04,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {11827#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {11827#false} is VALID [2022-04-15 11:45:04,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {11827#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11827#false} is VALID [2022-04-15 11:45:04,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {11827#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {11827#false} is VALID [2022-04-15 11:45:04,021 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-15 11:45:04,021 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-15 11:45:04,022 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-15 11:45:04,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {11827#false} assume 12292 != #t~mem85;havoc #t~mem85; {11827#false} is VALID [2022-04-15 11:45:04,023 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-15 11:45:04,023 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-15 11:45:04,026 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-15 11:45:04,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {11827#false} ~skip~0 := 0; {11827#false} is VALID [2022-04-15 11:45:04,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {11827#false} assume !false; {11827#false} is VALID [2022-04-15 11:45:04,026 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-15 11:45:04,026 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-15 11:45:04,026 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-15 11:45:04,026 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,027 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,028 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-15 11:45:04,029 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-15 11:45:04,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {11827#false} assume 8641 == #t~mem76;havoc #t~mem76; {11827#false} is VALID [2022-04-15 11:45:04,029 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-15 11:45:04,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {11827#false} assume !(9 == ~blastFlag~0); {11827#false} is VALID [2022-04-15 11:45:04,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {11827#false} assume 12 == ~blastFlag~0; {11827#false} is VALID [2022-04-15 11:45:04,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {11827#false} assume !false; {11827#false} is VALID [2022-04-15 11:45:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297526607] [2022-04-15 11:45:04,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297526607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:04,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:04,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:04,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335165699] [2022-04-15 11:45:04,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335165699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:04,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:04,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980391538] [2022-04-15 11:45:04,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:04,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:45:04,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:04,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:04,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:04,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:04,072 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-15 11:45:08,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:10,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:13,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:14,944 INFO L93 Difference]: Finished difference Result 766 states and 1206 transitions. [2022-04-15 11:45:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:14,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 11:45:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-15 11:45:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-15 11:45:14,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-15 11:45:15,374 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-15 11:45:15,388 INFO L225 Difference]: With dead ends: 766 [2022-04-15 11:45:15,388 INFO L226 Difference]: Without dead ends: 589 [2022-04-15 11:45:15,388 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:15,389 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:15,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 362 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:45:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-04-15 11:45:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 383. [2022-04-15 11:45:15,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:15,404 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-15 11:45:15,405 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-15 11:45:15,405 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-15 11:45:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:15,418 INFO L93 Difference]: Finished difference Result 589 states and 917 transitions. [2022-04-15 11:45:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 917 transitions. [2022-04-15 11:45:15,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:15,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:15,420 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-15 11:45:15,421 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-15 11:45:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:15,433 INFO L93 Difference]: Finished difference Result 589 states and 917 transitions. [2022-04-15 11:45:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 917 transitions. [2022-04-15 11:45:15,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:15,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:15,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:15,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:15,435 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-15 11:45:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 599 transitions. [2022-04-15 11:45:15,442 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 599 transitions. Word has length 65 [2022-04-15 11:45:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:15,443 INFO L478 AbstractCegarLoop]: Abstraction has 383 states and 599 transitions. [2022-04-15 11:45:15,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:15,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 383 states and 599 transitions. [2022-04-15 11:45:15,898 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-15 11:45:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 599 transitions. [2022-04-15 11:45:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:45:15,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:15,899 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-15 11:45:15,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:45:15,899 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash -615987875, now seen corresponding path program 1 times [2022-04-15 11:45:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134110738] [2022-04-15 11:45:16,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:45:16,018 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:45:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash -591595560, now seen corresponding path program 1 times [2022-04-15 11:45:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:16,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103996596] [2022-04-15 11:45:16,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:16,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:16,116 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-15 11:45:16,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {15314#true} assume true; {15314#true} is VALID [2022-04-15 11:45:16,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15314#true} {15314#true} #710#return; {15314#true} is VALID [2022-04-15 11:45:16,117 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-15 11:45:16,118 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-15 11:45:16,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {15314#true} assume true; {15314#true} is VALID [2022-04-15 11:45:16,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15314#true} {15314#true} #710#return; {15314#true} is VALID [2022-04-15 11:45:16,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {15314#true} call #t~ret161 := main(); {15314#true} is VALID [2022-04-15 11:45:16,118 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-15 11:45:16,119 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-15 11:45:16,119 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-15 11:45:16,119 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-15 11:45:16,119 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-15 11:45:16,119 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-15 11:45:16,120 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-15 11:45:16,120 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-15 11:45:16,120 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-15 11:45:16,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} [720] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.offset_323| |v_#memory_$Pointer$.offset_317|)) (.cse1 (= |v_ssl3_accept_#t~mem47_28| |v_ssl3_accept_#t~mem47_26|)) (.cse2 (= |v_ssl3_accept_#t~mem49_10| |v_ssl3_accept_#t~mem49_8|)) (.cse3 (= |v_ssl3_accept_#t~mem83.base_26| |v_ssl3_accept_#t~mem83.base_24|)) (.cse4 (= |v_ssl3_accept_#t~mem83.offset_26| |v_ssl3_accept_#t~mem83.offset_24|)) (.cse5 (= |v_ssl3_accept_#t~mem150.base_24| |v_ssl3_accept_#t~mem150.base_22|)) (.cse6 (= |v_ssl3_accept_#t~mem88.offset_15| |v_ssl3_accept_#t~mem88.offset_14|)) (.cse7 (= |v_ssl3_accept_#t~mem82_26| |v_ssl3_accept_#t~mem82_24|)) (.cse8 (= v_ssl3_accept_~skip~0_27 v_ssl3_accept_~skip~0_26)) (.cse9 (= |v_ssl3_accept_#t~mem88.base_15| |v_ssl3_accept_#t~mem88.base_14|)) (.cse10 (= |v_ssl3_accept_#t~mem89_15| |v_ssl3_accept_#t~mem89_14|)) (.cse11 (= |v_ssl3_accept_#t~mem85_26| |v_ssl3_accept_#t~mem85_24|)) (.cse12 (= |v_ssl3_accept_#t~mem150.offset_24| |v_ssl3_accept_#t~mem150.offset_22|)) (.cse13 (= |v_ssl3_accept_#t~mem151_26| |v_ssl3_accept_#t~mem151_24|)) (.cse14 (= v_ssl3_accept_~state~0_19 v_ssl3_accept_~state~0_18)) (.cse15 (= |v_ssl3_accept_#t~mem48_26| |v_ssl3_accept_#t~mem48_24|)) (.cse16 (= |v_ssl3_accept_#t~mem46_17| |v_ssl3_accept_#t~mem46_16|)) (.cse17 (= |v_#memory_$Pointer$.base_323| |v_#memory_$Pointer$.base_317|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_#memory_int_306| |v_#memory_int_311|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_#memory_int_311| |v_#memory_int_306|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_323|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_26|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_26|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_15|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_26|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_26|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_24|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_28|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_17|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_27, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_15|, #memory_int=|v_#memory_int_311|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_323|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_19} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_317|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_24|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_24|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_24|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_22|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_14|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_24|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_24|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_22|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_26|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_26, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_14|, #memory_int=|v_#memory_int_306|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_317|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {15319#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:16,121 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-15 11:45:16,121 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-15 11:45:16,121 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-15 11:45:16,122 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-15 11:45:16,122 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-15 11:45:16,122 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-15 11:45:16,122 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-15 11:45:16,123 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-15 11:45:16,123 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-15 11:45:16,123 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-15 11:45:16,123 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-15 11:45:16,124 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-15 11:45:16,124 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-15 11:45:16,124 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-15 11:45:16,124 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-15 11:45:16,125 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-15 11:45:16,125 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-15 11:45:16,125 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-15 11:45:16,125 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-15 11:45:16,126 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-15 11:45:16,126 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-15 11:45:16,126 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-15 11:45:16,126 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-15 11:45:16,126 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-15 11:45:16,127 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-15 11:45:16,127 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-15 11:45:16,127 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-15 11:45:16,127 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-15 11:45:16,128 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-15 11:45:16,128 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-15 11:45:16,128 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-15 11:45:16,128 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-15 11:45:16,129 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-15 11:45:16,129 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-15 11:45:16,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {15315#false} is VALID [2022-04-15 11:45:16,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {15315#false} assume !false; {15315#false} is VALID [2022-04-15 11:45:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103996596] [2022-04-15 11:45:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103996596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:45:19,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:19,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134110738] [2022-04-15 11:45:19,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134110738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:19,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:19,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:45:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760408968] [2022-04-15 11:45:19,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:19,321 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-15 11:45:19,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:19,321 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-15 11:45:19,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:19,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:45:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:45:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:45:19,377 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-15 11:45:25,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:28,120 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-15 11:45:31,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:36,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:38,062 INFO L93 Difference]: Finished difference Result 577 states and 907 transitions. [2022-04-15 11:45:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:45:38,062 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-15 11:45:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:38,062 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-15 11:45:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 612 transitions. [2022-04-15 11:45:38,065 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-15 11:45:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 612 transitions. [2022-04-15 11:45:38,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 612 transitions. [2022-04-15 11:45:38,466 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-15 11:45:38,473 INFO L225 Difference]: With dead ends: 577 [2022-04-15 11:45:38,473 INFO L226 Difference]: Without dead ends: 395 [2022-04-15 11:45:38,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:45:38,474 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 145 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s 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, 9.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:38,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 809 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 789 Invalid, 1 Unknown, 150 Unchecked, 9.2s Time] [2022-04-15 11:45:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-15 11:45:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 385. [2022-04-15 11:45:38,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:38,486 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-15 11:45:38,487 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-15 11:45:38,487 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-15 11:45:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:38,494 INFO L93 Difference]: Finished difference Result 395 states and 614 transitions. [2022-04-15 11:45:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 614 transitions. [2022-04-15 11:45:38,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:38,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:38,496 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-15 11:45:38,497 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-15 11:45:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:38,504 INFO L93 Difference]: Finished difference Result 395 states and 614 transitions. [2022-04-15 11:45:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 614 transitions. [2022-04-15 11:45:38,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:38,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:38,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:38,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:38,505 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-15 11:45:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 602 transitions. [2022-04-15 11:45:38,513 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 602 transitions. Word has length 65 [2022-04-15 11:45:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:38,513 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 602 transitions. [2022-04-15 11:45:38,513 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-15 11:45:38,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 602 transitions. [2022-04-15 11:45:39,173 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-15 11:45:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 602 transitions. [2022-04-15 11:45:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:45:39,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:39,175 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-15 11:45:39,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:45:39,175 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 277498463, now seen corresponding path program 1 times [2022-04-15 11:45:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:39,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1060965399] [2022-04-15 11:45:39,333 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:45:39,333 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:45:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash -326430824, now seen corresponding path program 1 times [2022-04-15 11:45:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:39,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115095366] [2022-04-15 11:45:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:39,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:39,462 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-15 11:45:39,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {18047#true} assume true; {18047#true} is VALID [2022-04-15 11:45:39,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18047#true} {18047#true} #710#return; {18047#true} is VALID [2022-04-15 11:45:39,463 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-15 11:45:39,464 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-15 11:45:39,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {18047#true} assume true; {18047#true} is VALID [2022-04-15 11:45:39,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18047#true} {18047#true} #710#return; {18047#true} is VALID [2022-04-15 11:45:39,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {18047#true} call #t~ret161 := main(); {18047#true} is VALID [2022-04-15 11:45:39,464 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-15 11:45:39,464 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-15 11:45:39,464 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-15 11:45:39,464 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-15 11:45:39,465 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-15 11:45:39,465 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-15 11:45:39,465 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-15 11:45:39,465 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-15 11:45:39,466 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-15 11:45:39,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} [722] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_33| |v_ssl3_accept_#t~mem82_31|)) (.cse1 (= |v_ssl3_accept_#t~mem89_20| |v_ssl3_accept_#t~mem89_19|)) (.cse2 (= |v_ssl3_accept_#t~mem85_33| |v_ssl3_accept_#t~mem85_31|)) (.cse3 (= v_ssl3_accept_~skip~0_32 v_ssl3_accept_~skip~0_31)) (.cse4 (= |v_ssl3_accept_#t~mem151_32| |v_ssl3_accept_#t~mem151_30|)) (.cse5 (= |v_#memory_$Pointer$.offset_343| |v_#memory_$Pointer$.offset_337|)) (.cse6 (= |v_ssl3_accept_#t~mem83.base_33| |v_ssl3_accept_#t~mem83.base_31|)) (.cse7 (= |v_#memory_$Pointer$.base_343| |v_#memory_$Pointer$.base_337|)) (.cse8 (= |v_ssl3_accept_#t~mem46_22| |v_ssl3_accept_#t~mem46_21|)) (.cse9 (= |v_ssl3_accept_#t~mem47_35| |v_ssl3_accept_#t~mem47_33|)) (.cse10 (= v_ssl3_accept_~state~0_24 v_ssl3_accept_~state~0_23)) (.cse11 (= |v_ssl3_accept_#t~mem83.offset_33| |v_ssl3_accept_#t~mem83.offset_31|)) (.cse12 (= |v_ssl3_accept_#t~mem48_33| |v_ssl3_accept_#t~mem48_31|))) (or (and .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem49_17| |v_ssl3_accept_#t~mem49_15|) .cse3 .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_28|) .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_28|) (= |v_#memory_int_330| |v_#memory_int_325|) .cse11 (= |v_ssl3_accept_#t~mem88.base_20| |v_ssl3_accept_#t~mem88.base_19|) .cse12 (= |v_ssl3_accept_#t~mem88.offset_20| |v_ssl3_accept_#t~mem88.offset_19|)) (and (= |v_ssl3_accept_#t~mem150.offset_28| |v_ssl3_accept_#t~mem150.offset_30|) .cse0 (= |v_#memory_int_325| |v_#memory_int_330|) .cse1 .cse2 (= |v_ssl3_accept_#t~mem150.base_28| |v_ssl3_accept_#t~mem150.base_30|) (= |v_ssl3_accept_#t~mem88.base_19| |v_ssl3_accept_#t~mem88.base_20|) .cse3 .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem88.offset_19| |v_ssl3_accept_#t~mem88.offset_20|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem49_15| |v_ssl3_accept_#t~mem49_17|) .cse12))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_343|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_33|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_33|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_30|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_20|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_33|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_33|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_35|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_22|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_32, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_20|, #memory_int=|v_#memory_int_330|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_343|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_24} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_337|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_31|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_31|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_19|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_31|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_33|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_21|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_31, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_19|, #memory_int=|v_#memory_int_325|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_19|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_337|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_23} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {18052#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,467 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-15 11:45:39,467 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-15 11:45:39,467 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-15 11:45:39,467 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-15 11:45:39,468 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-15 11:45:39,468 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-15 11:45:39,468 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-15 11:45:39,468 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-15 11:45:39,469 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-15 11:45:39,469 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-15 11:45:39,469 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-15 11:45:39,469 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-15 11:45:39,470 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-15 11:45:39,470 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-15 11:45:39,470 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-15 11:45:39,470 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-15 11:45:39,471 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-15 11:45:39,476 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-15 11:45:39,476 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-15 11:45:39,476 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-15 11:45:39,477 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-15 11:45:39,477 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-15 11:45:39,477 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-15 11:45:39,477 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-15 11:45:39,478 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-15 11:45:39,478 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-15 11:45:39,478 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-15 11:45:39,478 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-15 11:45:39,479 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-15 11:45:39,479 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-15 11:45:39,479 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-15 11:45:39,479 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-15 11:45:39,480 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-15 11:45:39,480 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-15 11:45:39,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {18048#false} is VALID [2022-04-15 11:45:39,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {18048#false} assume !false; {18048#false} is VALID [2022-04-15 11:45:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:39,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:39,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115095366] [2022-04-15 11:45:39,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115095366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:39,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:39,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:45:42,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:42,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1060965399] [2022-04-15 11:45:42,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1060965399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:42,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:42,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:45:42,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098392841] [2022-04-15 11:45:42,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:42,471 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-15 11:45:42,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:42,472 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-15 11:45:42,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:42,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:45:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:45:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:45:42,534 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-15 11:45:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:47,107 INFO L93 Difference]: Finished difference Result 578 states and 908 transitions. [2022-04-15 11:45:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:45:47,107 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-15 11:45:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:47,108 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-15 11:45:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 453 transitions. [2022-04-15 11:45:47,111 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-15 11:45:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 453 transitions. [2022-04-15 11:45:47,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 453 transitions. [2022-04-15 11:45:47,448 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-15 11:45:47,455 INFO L225 Difference]: With dead ends: 578 [2022-04-15 11:45:47,455 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 11:45:47,456 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-15 11:45:47,458 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 9 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:47,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 469 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 154 Unchecked, 1.6s Time] [2022-04-15 11:45:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 11:45:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2022-04-15 11:45:47,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:47,470 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-15 11:45:47,471 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-15 11:45:47,471 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-15 11:45:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:47,478 INFO L93 Difference]: Finished difference Result 396 states and 615 transitions. [2022-04-15 11:45:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2022-04-15 11:45:47,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:47,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:47,479 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-15 11:45:47,480 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-15 11:45:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:47,486 INFO L93 Difference]: Finished difference Result 396 states and 615 transitions. [2022-04-15 11:45:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2022-04-15 11:45:47,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:47,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:47,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:47,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:47,488 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-15 11:45:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 602 transitions. [2022-04-15 11:45:47,496 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 602 transitions. Word has length 65 [2022-04-15 11:45:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:47,496 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 602 transitions. [2022-04-15 11:45:47,496 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-15 11:45:47,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 602 transitions. [2022-04-15 11:45:48,635 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-15 11:45:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 602 transitions. [2022-04-15 11:45:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:45:48,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:48,636 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-15 11:45:48,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:45:48,636 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 213696620, now seen corresponding path program 1 times [2022-04-15 11:45:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:48,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374004270] [2022-04-15 11:45:48,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:48,653 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:48,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash 213696620, now seen corresponding path program 2 times [2022-04-15 11:45:48,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:48,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816665242] [2022-04-15 11:45:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:48,765 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-15 11:45:48,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {20784#true} assume true; {20784#true} is VALID [2022-04-15 11:45:48,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20784#true} {20784#true} #710#return; {20784#true} is VALID [2022-04-15 11:45:48,766 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-15 11:45:48,766 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-15 11:45:48,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {20784#true} assume true; {20784#true} is VALID [2022-04-15 11:45:48,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20784#true} {20784#true} #710#return; {20784#true} is VALID [2022-04-15 11:45:48,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {20784#true} call #t~ret161 := main(); {20784#true} is VALID [2022-04-15 11:45:48,767 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-15 11:45:48,767 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-15 11:45:48,767 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-15 11:45:48,769 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-15 11:45:48,769 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-15 11:45:48,770 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-15 11:45:48,770 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-15 11:45:48,771 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-15 11:45:48,771 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-15 11:45:48,771 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-15 11:45:48,772 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-15 11:45:48,772 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-15 11:45:48,772 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-15 11:45:48,773 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-15 11:45:48,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {20785#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20785#false} is VALID [2022-04-15 11:45:48,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {20785#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20785#false} is VALID [2022-04-15 11:45:48,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {20785#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20785#false} is VALID [2022-04-15 11:45:48,773 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-15 11:45:48,773 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-15 11:45:48,773 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-15 11:45:48,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {20785#false} assume 12292 != #t~mem85;havoc #t~mem85; {20785#false} is VALID [2022-04-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {20785#false} ~skip~0 := 0; {20785#false} is VALID [2022-04-15 11:45:48,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {20785#false} assume !false; {20785#false} is VALID [2022-04-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,774 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,775 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-15 11:45:48,776 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-15 11:45:48,776 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-15 11:45:48,776 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-15 11:45:48,776 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-15 11:45:48,776 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-15 11:45:48,776 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-15 11:45:48,776 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-15 11:45:48,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {20785#false} assume 8641 == #t~mem76;havoc #t~mem76; {20785#false} is VALID [2022-04-15 11:45:48,776 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-15 11:45:48,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {20785#false} assume !(9 == ~blastFlag~0); {20785#false} is VALID [2022-04-15 11:45:48,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {20785#false} assume 12 == ~blastFlag~0; {20785#false} is VALID [2022-04-15 11:45:48,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {20785#false} assume !false; {20785#false} is VALID [2022-04-15 11:45:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:48,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816665242] [2022-04-15 11:45:48,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816665242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:48,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:48,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:48,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:48,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374004270] [2022-04-15 11:45:48,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374004270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:48,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:48,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:48,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128003158] [2022-04-15 11:45:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:48,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:45:48,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:48,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:48,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:48,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:48,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:48,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:48,838 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-15 11:45:53,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:55,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:57,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:59,142 INFO L93 Difference]: Finished difference Result 590 states and 922 transitions. [2022-04-15 11:45:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:59,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:45:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-15 11:45:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-15 11:45:59,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 458 transitions. [2022-04-15 11:45:59,416 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-15 11:45:59,423 INFO L225 Difference]: With dead ends: 590 [2022-04-15 11:45:59,423 INFO L226 Difference]: Without dead ends: 401 [2022-04-15 11:45:59,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:59,424 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:59,424 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.6s Time] [2022-04-15 11:45:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-15 11:45:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 385. [2022-04-15 11:45:59,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:59,436 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-15 11:45:59,436 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-15 11:45:59,437 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-15 11:45:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:59,443 INFO L93 Difference]: Finished difference Result 401 states and 620 transitions. [2022-04-15 11:45:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 620 transitions. [2022-04-15 11:45:59,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:59,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:59,444 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-15 11:45:59,444 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-15 11:45:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:59,451 INFO L93 Difference]: Finished difference Result 401 states and 620 transitions. [2022-04-15 11:45:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 620 transitions. [2022-04-15 11:45:59,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:59,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:59,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:59,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:59,452 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-15 11:45:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 601 transitions. [2022-04-15 11:45:59,459 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 601 transitions. Word has length 66 [2022-04-15 11:45:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:59,459 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 601 transitions. [2022-04-15 11:45:59,459 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:59,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 601 transitions. [2022-04-15 11:46:00,518 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-15 11:46:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 601 transitions. [2022-04-15 11:46:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:46:00,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:00,519 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-15 11:46:00,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:46:00,519 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -208594083, now seen corresponding path program 1 times [2022-04-15 11:46:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:00,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335861190] [2022-04-15 11:46:00,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:46:00,744 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:46:00,744 INFO L85 PathProgramCache]: Analyzing trace with hash -61266088, now seen corresponding path program 1 times [2022-04-15 11:46:00,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:00,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284122685] [2022-04-15 11:46:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:00,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:00,861 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-15 11:46:00,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {23548#true} assume true; {23548#true} is VALID [2022-04-15 11:46:00,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23548#true} {23548#true} #710#return; {23548#true} is VALID [2022-04-15 11:46:00,862 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-15 11:46:00,862 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-15 11:46:00,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {23548#true} assume true; {23548#true} is VALID [2022-04-15 11:46:00,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23548#true} {23548#true} #710#return; {23548#true} is VALID [2022-04-15 11:46:00,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {23548#true} call #t~ret161 := main(); {23548#true} is VALID [2022-04-15 11:46:00,862 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-15 11:46:00,862 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-15 11:46:00,863 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-15 11:46:00,863 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-15 11:46:00,863 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-15 11:46:00,863 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-15 11:46:00,864 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-15 11:46:00,864 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-15 11:46:00,864 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-15 11:46:00,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} [724] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_int_360| |v_#memory_int_355|)) (.cse1 (= |v_ssl3_accept_#t~mem82_42| |v_ssl3_accept_#t~mem82_40|)) (.cse2 (= |v_ssl3_accept_#t~mem83.offset_42| |v_ssl3_accept_#t~mem83.offset_40|)) (.cse3 (= |v_ssl3_accept_#t~mem150.offset_38| |v_ssl3_accept_#t~mem150.offset_36|)) (.cse4 (= |v_ssl3_accept_#t~mem46_28| |v_ssl3_accept_#t~mem46_27|)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_25| |v_ssl3_accept_#t~mem88.base_24|)) (.cse6 (= |v_#memory_$Pointer$.base_384| |v_#memory_$Pointer$.base_378|)) (.cse7 (= |v_#memory_$Pointer$.offset_384| |v_#memory_$Pointer$.offset_378|)) (.cse8 (= |v_ssl3_accept_#t~mem50_10| |v_ssl3_accept_#t~mem50_8|)) (.cse9 (= |v_ssl3_accept_#t~mem89_25| |v_ssl3_accept_#t~mem89_24|)) (.cse10 (= |v_ssl3_accept_#t~mem83.base_42| |v_ssl3_accept_#t~mem83.base_40|)) (.cse11 (= |v_ssl3_accept_#t~mem48_42| |v_ssl3_accept_#t~mem48_40|)) (.cse12 (= |v_ssl3_accept_#t~mem47_44| |v_ssl3_accept_#t~mem47_42|)) (.cse13 (= v_ssl3_accept_~skip~0_38 v_ssl3_accept_~skip~0_37)) (.cse14 (= |v_ssl3_accept_#t~mem150.base_38| |v_ssl3_accept_#t~mem150.base_36|)) (.cse15 (= |v_ssl3_accept_#t~mem49_26| |v_ssl3_accept_#t~mem49_24|)) (.cse16 (= |v_ssl3_accept_#t~mem88.offset_25| |v_ssl3_accept_#t~mem88.offset_24|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_ssl3_accept_#t~mem151_38| |v_ssl3_accept_#t~mem151_40|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= v_ssl3_accept_~state~0_29 v_ssl3_accept_~state~0_30) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |v_ssl3_accept_#t~mem85_40| |v_ssl3_accept_#t~mem85_42|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_ssl3_accept_~state~0_30 v_ssl3_accept_~state~0_29) .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem151_40| |v_ssl3_accept_#t~mem151_38|) .cse12 (= |v_ssl3_accept_#t~mem85_42| |v_ssl3_accept_#t~mem85_40|) .cse13 .cse14 .cse15 .cse16))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_384|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_42|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_42|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_40|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_38|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_25|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_42|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_26|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_42|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_38|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_44|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_38, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_25|, #memory_int=|v_#memory_int_360|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_25|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_384|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_30} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_40|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_378|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_40|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_40|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_38|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_36|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_24|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_40|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_40|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_36|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_42|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_27|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_37, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_24|, #memory_int=|v_#memory_int_355|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_378|, 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] {23553#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:00,865 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-15 11:46:00,865 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-15 11:46:00,865 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-15 11:46:00,866 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-15 11:46:00,866 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-15 11:46:00,866 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-15 11:46:00,867 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-15 11:46:00,867 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-15 11:46:00,867 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-15 11:46:00,868 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-15 11:46:00,868 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-15 11:46:00,868 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-15 11:46:00,869 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-15 11:46:00,869 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-15 11:46:00,869 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-15 11:46:00,870 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-15 11:46:00,870 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-15 11:46:00,870 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-15 11:46:00,870 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-15 11:46:00,871 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-15 11:46:00,871 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-15 11:46:00,871 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-15 11:46:00,872 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-15 11:46:00,872 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-15 11:46:00,872 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-15 11:46:00,873 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-15 11:46:00,873 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-15 11:46:00,873 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-15 11:46:00,874 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-15 11:46:00,874 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-15 11:46:00,874 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-15 11:46:00,875 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-15 11:46:00,875 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-15 11:46:00,875 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-15 11:46:00,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {23549#false} is VALID [2022-04-15 11:46:00,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {23549#false} assume !false; {23549#false} is VALID [2022-04-15 11:46:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:00,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284122685] [2022-04-15 11:46:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284122685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:00,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:00,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:46:04,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:04,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335861190] [2022-04-15 11:46:04,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335861190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:04,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:04,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:46:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089024337] [2022-04-15 11:46:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:04,678 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-15 11:46:04,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:04,678 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-15 11:46:04,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:04,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:46:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:46:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:46:04,746 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-15 11:46:06,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:09,869 INFO L93 Difference]: Finished difference Result 579 states and 909 transitions. [2022-04-15 11:46:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:46:09,870 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-15 11:46:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:09,870 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-15 11:46:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 612 transitions. [2022-04-15 11:46:09,872 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-15 11:46:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 612 transitions. [2022-04-15 11:46:09,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 612 transitions. [2022-04-15 11:46:10,270 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-15 11:46:10,285 INFO L225 Difference]: With dead ends: 579 [2022-04-15 11:46:10,285 INFO L226 Difference]: Without dead ends: 397 [2022-04-15 11:46:10,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:46:10,286 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 146 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:10,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 786 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 853 Invalid, 1 Unknown, 18 Unchecked, 3.1s Time] [2022-04-15 11:46:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-15 11:46:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 385. [2022-04-15 11:46:10,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:10,309 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-15 11:46:10,310 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-15 11:46:10,311 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-15 11:46:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:10,317 INFO L93 Difference]: Finished difference Result 397 states and 616 transitions. [2022-04-15 11:46:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 616 transitions. [2022-04-15 11:46:10,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:10,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:10,318 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-15 11:46:10,318 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-15 11:46:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:10,325 INFO L93 Difference]: Finished difference Result 397 states and 616 transitions. [2022-04-15 11:46:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 616 transitions. [2022-04-15 11:46:10,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:10,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:10,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:10,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:10,326 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-15 11:46:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 601 transitions. [2022-04-15 11:46:10,333 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 601 transitions. Word has length 66 [2022-04-15 11:46:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:10,333 INFO L478 AbstractCegarLoop]: Abstraction has 385 states and 601 transitions. [2022-04-15 11:46:10,333 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-15 11:46:10,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 601 transitions. [2022-04-15 11:46:12,008 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-15 11:46:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 601 transitions. [2022-04-15 11:46:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:46:12,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:12,009 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-15 11:46:12,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:46:12,009 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash 684892255, now seen corresponding path program 1 times [2022-04-15 11:46:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:12,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775118398] [2022-04-15 11:46:12,223 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:46:12,224 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:46:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 203898648, now seen corresponding path program 1 times [2022-04-15 11:46:12,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:12,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606207428] [2022-04-15 11:46:12,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:12,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:12,345 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-15 11:46:12,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {26290#true} assume true; {26290#true} is VALID [2022-04-15 11:46:12,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26290#true} {26290#true} #710#return; {26290#true} is VALID [2022-04-15 11:46:12,346 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-15 11:46:12,346 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-15 11:46:12,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {26290#true} assume true; {26290#true} is VALID [2022-04-15 11:46:12,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26290#true} {26290#true} #710#return; {26290#true} is VALID [2022-04-15 11:46:12,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {26290#true} call #t~ret161 := main(); {26290#true} is VALID [2022-04-15 11:46:12,346 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-15 11:46:12,346 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-15 11:46:12,346 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-15 11:46:12,347 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-15 11:46:12,347 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-15 11:46:12,347 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-15 11:46:12,348 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-15 11:46:12,348 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-15 11:46:12,348 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-15 11:46:12,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} [726] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_30| |v_ssl3_accept_#t~mem88.offset_29|)) (.cse1 (= |v_ssl3_accept_#t~mem82_49| |v_ssl3_accept_#t~mem82_47|)) (.cse2 (= |v_ssl3_accept_#t~mem150.base_44| |v_ssl3_accept_#t~mem150.base_42|)) (.cse3 (= |v_ssl3_accept_#t~mem85_49| |v_ssl3_accept_#t~mem85_47|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_30| |v_ssl3_accept_#t~mem88.base_29|)) (.cse5 (= |v_ssl3_accept_#t~mem46_33| |v_ssl3_accept_#t~mem46_32|)) (.cse6 (= |v_ssl3_accept_#t~mem150.offset_44| |v_ssl3_accept_#t~mem150.offset_42|)) (.cse7 (= v_ssl3_accept_~state~0_35 v_ssl3_accept_~state~0_34)) (.cse8 (= |v_ssl3_accept_#t~mem49_33| |v_ssl3_accept_#t~mem49_31|)) (.cse9 (= |v_ssl3_accept_#t~mem151_46| |v_ssl3_accept_#t~mem151_44|)) (.cse10 (= |v_#memory_int_379| |v_#memory_int_374|)) (.cse11 (= |v_ssl3_accept_#t~mem50_17| |v_ssl3_accept_#t~mem50_15|)) (.cse12 (= |v_ssl3_accept_#t~mem83.offset_49| |v_ssl3_accept_#t~mem83.offset_47|)) (.cse13 (= v_ssl3_accept_~skip~0_43 v_ssl3_accept_~skip~0_42))) (or (and (= |v_ssl3_accept_#t~mem89_29| |v_ssl3_accept_#t~mem89_30|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem83.base_47| |v_ssl3_accept_#t~mem83.base_49|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem47_49| |v_ssl3_accept_#t~mem47_51|) (= |v_#memory_$Pointer$.offset_398| |v_#memory_$Pointer$.offset_404|) .cse12 (= |v_ssl3_accept_#t~mem48_47| |v_ssl3_accept_#t~mem48_49|) (= |v_#memory_$Pointer$.base_398| |v_#memory_$Pointer$.base_404|) .cse13) (and (= |v_ssl3_accept_#t~mem48_49| |v_ssl3_accept_#t~mem48_47|) .cse0 .cse1 .cse2 .cse3 (= |v_ssl3_accept_#t~mem89_30| |v_ssl3_accept_#t~mem89_29|) .cse4 .cse5 .cse6 .cse7 (= |v_#memory_$Pointer$.offset_404| |v_#memory_$Pointer$.offset_398|) .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem83.base_49| |v_ssl3_accept_#t~mem83.base_47|) (= |v_ssl3_accept_#t~mem47_51| |v_ssl3_accept_#t~mem47_49|) .cse12 (= |v_#memory_$Pointer$.base_404| |v_#memory_$Pointer$.base_398|) .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_404|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_49|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_49|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_46|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_44|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_17|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_30|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_49|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_33|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_49|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_44|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_51|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_33|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_43, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_30|, #memory_int=|v_#memory_int_379|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_30|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_404|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_35} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_398|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_47|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_47|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_44|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_42|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_15|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_29|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_47|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_31|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_47|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_42|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_49|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_42, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_29|, #memory_int=|v_#memory_int_374|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_29|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_398|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_34} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {26295#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:12,349 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-15 11:46:12,349 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-15 11:46:12,349 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-15 11:46:12,350 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-15 11:46:12,350 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-15 11:46:12,350 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-15 11:46:12,350 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-15 11:46:12,351 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-15 11:46:12,351 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-15 11:46:12,351 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-15 11:46:12,351 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-15 11:46:12,352 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-15 11:46:12,352 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-15 11:46:12,352 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-15 11:46:12,352 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-15 11:46:12,353 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-15 11:46:12,353 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-15 11:46:12,353 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-15 11:46:12,354 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-15 11:46:12,354 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-15 11:46:12,354 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-15 11:46:12,354 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-15 11:46:12,355 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-15 11:46:12,355 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-15 11:46:12,355 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-15 11:46:12,355 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-15 11:46:12,356 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-15 11:46:12,356 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-15 11:46:12,356 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-15 11:46:12,356 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-15 11:46:12,357 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-15 11:46:12,357 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-15 11:46:12,357 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-15 11:46:12,357 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-15 11:46:12,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {26291#false} is VALID [2022-04-15 11:46:12,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {26291#false} assume !false; {26291#false} is VALID [2022-04-15 11:46:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:12,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:12,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606207428] [2022-04-15 11:46:12,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606207428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:12,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:12,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:46:17,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775118398] [2022-04-15 11:46:17,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775118398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:17,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:17,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:46:17,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143912647] [2022-04-15 11:46:17,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:17,368 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-15 11:46:17,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:17,368 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-15 11:46:17,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:17,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:46:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:17,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:46:17,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:46:17,425 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-15 11:46:22,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-15 11:46:30,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:37,447 INFO L93 Difference]: Finished difference Result 755 states and 1196 transitions. [2022-04-15 11:46:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:46:37,448 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-15 11:46:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:37,448 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-15 11:46:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 633 transitions. [2022-04-15 11:46:37,450 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-15 11:46:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 633 transitions. [2022-04-15 11:46:37,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 633 transitions. [2022-04-15 11:46:37,842 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-15 11:46:37,855 INFO L225 Difference]: With dead ends: 755 [2022-04-15 11:46:37,855 INFO L226 Difference]: Without dead ends: 573 [2022-04-15 11:46:37,855 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-15 11:46:37,856 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 154 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:37,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 1081 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 775 Invalid, 2 Unknown, 702 Unchecked, 8.9s Time] [2022-04-15 11:46:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-04-15 11:46:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 564. [2022-04-15 11:46:37,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:37,872 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-15 11:46:37,873 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-15 11:46:37,873 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-15 11:46:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:37,883 INFO L93 Difference]: Finished difference Result 573 states and 890 transitions. [2022-04-15 11:46:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 890 transitions. [2022-04-15 11:46:37,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:37,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:37,885 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-15 11:46:37,885 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-15 11:46:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:37,896 INFO L93 Difference]: Finished difference Result 573 states and 890 transitions. [2022-04-15 11:46:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 890 transitions. [2022-04-15 11:46:37,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:37,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:37,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:37,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:37,898 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-15 11:46:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 879 transitions. [2022-04-15 11:46:37,911 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 879 transitions. Word has length 66 [2022-04-15 11:46:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:37,911 INFO L478 AbstractCegarLoop]: Abstraction has 564 states and 879 transitions. [2022-04-15 11:46:37,911 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-15 11:46:37,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 564 states and 879 transitions. [2022-04-15 11:46:40,774 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-15 11:46:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 879 transitions. [2022-04-15 11:46:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:46:40,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:40,776 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-15 11:46:40,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:46:40,776 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash -260095797, now seen corresponding path program 1 times [2022-04-15 11:46:40,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:40,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95110887] [2022-04-15 11:46:40,792 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:40,792 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:40,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -260095797, now seen corresponding path program 2 times [2022-04-15 11:46:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:40,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286601267] [2022-04-15 11:46:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:40,979 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-15 11:46:40,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {30094#true} assume true; {30094#true} is VALID [2022-04-15 11:46:40,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30094#true} {30094#true} #710#return; {30094#true} is VALID [2022-04-15 11:46:40,980 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-15 11:46:40,980 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-15 11:46:40,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {30094#true} assume true; {30094#true} is VALID [2022-04-15 11:46:40,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30094#true} {30094#true} #710#return; {30094#true} is VALID [2022-04-15 11:46:40,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {30094#true} call #t~ret161 := main(); {30094#true} is VALID [2022-04-15 11:46:40,980 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-15 11:46:40,980 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-15 11:46:40,980 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-15 11:46:40,980 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-15 11:46:40,980 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-15 11:46:40,980 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-15 11:46:40,980 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {30094#true} assume !false; {30094#true} is VALID [2022-04-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 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-15 11:46:40,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#true} assume 8464 == #t~mem55;havoc #t~mem55; {30094#true} is VALID [2022-04-15 11:46:40,982 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-15 11:46:40,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30094#true} is VALID [2022-04-15 11:46:40,983 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#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {30099#(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; {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,992 INFO L290 TraceCheckUtils]: 51: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,993 INFO L290 TraceCheckUtils]: 55: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {30099#(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); {30099#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:40,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {30099#(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); {30100#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-15 11:46:40,996 INFO L290 TraceCheckUtils]: 62: Hoare triple {30100#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {30095#false} is VALID [2022-04-15 11:46:40,996 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-15 11:46:40,996 INFO L290 TraceCheckUtils]: 64: Hoare triple {30095#false} assume !(9 == ~blastFlag~0); {30095#false} is VALID [2022-04-15 11:46:40,996 INFO L290 TraceCheckUtils]: 65: Hoare triple {30095#false} assume 12 == ~blastFlag~0; {30095#false} is VALID [2022-04-15 11:46:40,996 INFO L290 TraceCheckUtils]: 66: Hoare triple {30095#false} assume !false; {30095#false} is VALID [2022-04-15 11:46:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:40,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286601267] [2022-04-15 11:46:40,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286601267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:40,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:40,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:40,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:40,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95110887] [2022-04-15 11:46:40,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95110887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:40,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:40,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24829189] [2022-04-15 11:46:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:40,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:46:40,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:40,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:41,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:41,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:41,047 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-15 11:46:43,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:46,539 INFO L93 Difference]: Finished difference Result 1424 states and 2214 transitions. [2022-04-15 11:46:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:46,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 11:46:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-15 11:46:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-15 11:46:46,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 614 transitions. [2022-04-15 11:46:46,925 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-15 11:46:46,954 INFO L225 Difference]: With dead ends: 1424 [2022-04-15 11:46:46,954 INFO L226 Difference]: Without dead ends: 886 [2022-04-15 11:46:46,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:46,955 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 129 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:46,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 380 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 489 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:46:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-04-15 11:46:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 648. [2022-04-15 11:46:46,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:46,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 886 states. Second operand has 648 states, 643 states have (on average 1.6174183514774494) internal successors, (1040), 643 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:46,978 INFO L74 IsIncluded]: Start isIncluded. First operand 886 states. Second operand has 648 states, 643 states have (on average 1.6174183514774494) internal successors, (1040), 643 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:46,979 INFO L87 Difference]: Start difference. First operand 886 states. Second operand has 648 states, 643 states have (on average 1.6174183514774494) internal successors, (1040), 643 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:47,001 INFO L93 Difference]: Finished difference Result 886 states and 1366 transitions. [2022-04-15 11:46:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1366 transitions. [2022-04-15 11:46:47,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:47,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:47,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 648 states, 643 states have (on average 1.6174183514774494) internal successors, (1040), 643 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 886 states. [2022-04-15 11:46:47,003 INFO L87 Difference]: Start difference. First operand has 648 states, 643 states have (on average 1.6174183514774494) internal successors, (1040), 643 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 886 states. [2022-04-15 11:46:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:47,026 INFO L93 Difference]: Finished difference Result 886 states and 1366 transitions. [2022-04-15 11:46:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1366 transitions. [2022-04-15 11:46:47,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:47,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:47,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:47,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 643 states have (on average 1.6174183514774494) internal successors, (1040), 643 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1044 transitions. [2022-04-15 11:46:47,044 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1044 transitions. Word has length 67 [2022-04-15 11:46:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:47,045 INFO L478 AbstractCegarLoop]: Abstraction has 648 states and 1044 transitions. [2022-04-15 11:46:47,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:47,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 648 states and 1044 transitions. [2022-04-15 11:46:50,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1044 edges. 1043 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1044 transitions. [2022-04-15 11:46:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 11:46:50,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:50,129 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-04-15 11:46:50,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:46:50,129 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash -344516719, now seen corresponding path program 1 times [2022-04-15 11:46:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:50,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044516530] [2022-04-15 11:46:50,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:50,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:50,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -344516719, now seen corresponding path program 2 times [2022-04-15 11:46:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:50,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111841378] [2022-04-15 11:46:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:50,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {36029#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {36022#true} is VALID [2022-04-15 11:46:50,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {36022#true} assume true; {36022#true} is VALID [2022-04-15 11:46:50,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36022#true} {36022#true} #710#return; {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {36022#true} call ULTIMATE.init(); {36029#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:46:50,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {36029#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {36022#true} assume true; {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36022#true} {36022#true} #710#return; {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {36022#true} call #t~ret161 := main(); {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {36022#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; {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {36022#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L272 TraceCheckUtils]: 7: Hoare triple {36022#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {36022#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); {36022#true} is VALID [2022-04-15 11:46:50,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {36022#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; {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {36022#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; {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {36022#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {36022#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {36022#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {36022#true} assume !false; {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {36022#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); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {36022#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {36022#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {36022#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {36022#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {36022#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {36022#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {36022#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {36022#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36022#true} is VALID [2022-04-15 11:46:50,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {36022#true} assume 8464 == #t~mem55;havoc #t~mem55; {36022#true} is VALID [2022-04-15 11:46:50,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {36022#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; {36022#true} is VALID [2022-04-15 11:46:50,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {36022#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36022#true} is VALID [2022-04-15 11:46:50,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {36022#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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {36027#(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; {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {36027#(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); {36027#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {36027#(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); {36028#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {36028#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {36023#false} assume !(~num1~0 > 0); {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {36023#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; {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {36023#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); {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {36023#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {36023#false} ~skip~0 := 0; {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {36023#false} assume !false; {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {36023#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); {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {36023#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {36023#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {36023#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {36023#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {36023#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {36023#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {36023#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {36023#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {36023#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {36023#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {36023#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {36023#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {36023#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 75: Hoare triple {36023#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 76: Hoare triple {36023#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,375 INFO L290 TraceCheckUtils]: 77: Hoare triple {36023#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {36023#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 79: Hoare triple {36023#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {36023#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {36023#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {36023#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 83: Hoare triple {36023#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {36023#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {36023#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {36023#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 87: Hoare triple {36023#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {36023#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 89: Hoare triple {36023#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 90: Hoare triple {36023#false} assume 8640 == #t~mem75;havoc #t~mem75; {36023#false} is VALID [2022-04-15 11:46:50,376 INFO L290 TraceCheckUtils]: 91: Hoare triple {36023#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36023#false} is VALID [2022-04-15 11:46:50,377 INFO L290 TraceCheckUtils]: 92: Hoare triple {36023#false} assume !(9 == ~blastFlag~0); {36023#false} is VALID [2022-04-15 11:46:50,377 INFO L290 TraceCheckUtils]: 93: Hoare triple {36023#false} assume 12 == ~blastFlag~0; {36023#false} is VALID [2022-04-15 11:46:50,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {36023#false} assume !false; {36023#false} is VALID [2022-04-15 11:46:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:50,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111841378] [2022-04-15 11:46:50,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111841378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:50,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:50,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:50,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:50,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044516530] [2022-04-15 11:46:50,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044516530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:50,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:50,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679012904] [2022-04-15 11:46:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:50,378 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 95 [2022-04-15 11:46:50,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:50,379 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-15 11:46:50,446 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-15 11:46:50,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:50,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:50,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:50,447 INFO L87 Difference]: Start difference. First operand 648 states and 1044 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-15 11:46:55,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:57,634 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-15 11:46:59,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:04,710 INFO L93 Difference]: Finished difference Result 1736 states and 2796 transitions. [2022-04-15 11:47:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:04,711 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 95 [2022-04-15 11:47:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:04,711 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-15 11:47:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:47:04,713 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-15 11:47:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:47:04,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-15 11:47:05,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:05,147 INFO L225 Difference]: With dead ends: 1736 [2022-04-15 11:47:05,147 INFO L226 Difference]: Without dead ends: 1114 [2022-04-15 11:47:05,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:05,149 INFO L913 BasicCegarLoop]: 267 mSDtfsCounter, 135 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:05,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 646 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 620 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-04-15 11:47:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2022-04-15 11:47:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 840. [2022-04-15 11:47:05,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:05,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1114 states. Second operand has 840 states, 835 states have (on average 1.6550898203592814) internal successors, (1382), 835 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:05,196 INFO L74 IsIncluded]: Start isIncluded. First operand 1114 states. Second operand has 840 states, 835 states have (on average 1.6550898203592814) internal successors, (1382), 835 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:05,196 INFO L87 Difference]: Start difference. First operand 1114 states. Second operand has 840 states, 835 states have (on average 1.6550898203592814) internal successors, (1382), 835 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:05,229 INFO L93 Difference]: Finished difference Result 1114 states and 1780 transitions. [2022-04-15 11:47:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1780 transitions. [2022-04-15 11:47:05,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:05,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:05,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 840 states, 835 states have (on average 1.6550898203592814) internal successors, (1382), 835 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1114 states. [2022-04-15 11:47:05,232 INFO L87 Difference]: Start difference. First operand has 840 states, 835 states have (on average 1.6550898203592814) internal successors, (1382), 835 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1114 states. [2022-04-15 11:47:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:05,266 INFO L93 Difference]: Finished difference Result 1114 states and 1780 transitions. [2022-04-15 11:47:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1780 transitions. [2022-04-15 11:47:05,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:05,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:05,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:05,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 835 states have (on average 1.6550898203592814) internal successors, (1382), 835 states have internal predecessors, (1382), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1386 transitions. [2022-04-15 11:47:05,298 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1386 transitions. Word has length 95 [2022-04-15 11:47:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:05,298 INFO L478 AbstractCegarLoop]: Abstraction has 840 states and 1386 transitions. [2022-04-15 11:47:05,298 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-15 11:47:05,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 840 states and 1386 transitions. [2022-04-15 11:47:08,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1386 edges. 1385 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1386 transitions. [2022-04-15 11:47:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 11:47:08,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:08,501 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-15 11:47:08,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:47:08,501 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash 812039111, now seen corresponding path program 1 times [2022-04-15 11:47:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:08,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100610352] [2022-04-15 11:47:08,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:08,553 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:08,553 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 812039111, now seen corresponding path program 2 times [2022-04-15 11:47:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:08,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755918086] [2022-04-15 11:47:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:08,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {43421#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {43414#true} is VALID [2022-04-15 11:47:08,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {43414#true} assume true; {43414#true} is VALID [2022-04-15 11:47:08,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43414#true} {43414#true} #710#return; {43414#true} is VALID [2022-04-15 11:47:08,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {43414#true} call ULTIMATE.init(); {43421#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:08,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {43421#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {43414#true} is VALID [2022-04-15 11:47:08,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {43414#true} assume true; {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43414#true} {43414#true} #710#return; {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {43414#true} call #t~ret161 := main(); {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {43414#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; {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {43414#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L272 TraceCheckUtils]: 7: Hoare triple {43414#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {43414#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); {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {43414#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; {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {43414#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; {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {43414#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {43414#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {43414#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {43414#true} assume !false; {43414#true} is VALID [2022-04-15 11:47:08,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {43414#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); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {43414#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {43414#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {43414#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {43414#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {43414#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {43414#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {43414#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {43414#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {43414#true} assume 8464 == #t~mem55;havoc #t~mem55; {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {43414#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; {43414#true} is VALID [2022-04-15 11:47:08,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {43414#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43414#true} is VALID [2022-04-15 11:47:08,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {43414#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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {43419#(= 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; {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {43419#(= 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); {43419#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:08,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {43419#(= 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); {43420#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:47:08,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {43420#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {43415#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {43415#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {43415#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {43415#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {43415#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {43415#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {43415#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {43415#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {43415#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {43415#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {43415#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {43415#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {43415#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {43415#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {43415#false} assume 8608 == #t~mem73;havoc #t~mem73; {43415#false} is VALID [2022-04-15 11:47:08,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {43415#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {43415#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {43415#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); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {43415#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); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {43415#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {43415#false} ~skip~0 := 0; {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {43415#false} assume !false; {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {43415#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); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {43415#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {43415#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {43415#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {43415#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {43415#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {43415#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {43415#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {43415#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {43415#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {43415#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 78: Hoare triple {43415#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {43415#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {43415#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {43415#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {43415#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {43415#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {43415#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 85: Hoare triple {43415#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 86: Hoare triple {43415#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 87: Hoare triple {43415#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,735 INFO L290 TraceCheckUtils]: 88: Hoare triple {43415#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 89: Hoare triple {43415#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 90: Hoare triple {43415#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 91: Hoare triple {43415#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 92: Hoare triple {43415#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 93: Hoare triple {43415#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 94: Hoare triple {43415#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 95: Hoare triple {43415#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {43415#false} assume 8640 == #t~mem75;havoc #t~mem75; {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {43415#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {43415#false} assume !(9 == ~blastFlag~0); {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 99: Hoare triple {43415#false} assume 12 == ~blastFlag~0; {43415#false} is VALID [2022-04-15 11:47:08,736 INFO L290 TraceCheckUtils]: 100: Hoare triple {43415#false} assume !false; {43415#false} is VALID [2022-04-15 11:47:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 11:47:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:08,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755918086] [2022-04-15 11:47:08,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755918086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:08,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:08,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:08,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:08,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100610352] [2022-04-15 11:47:08,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100610352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:08,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:08,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379701273] [2022-04-15 11:47:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 11:47:08,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:08,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:08,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:08,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:08,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:08,798 INFO L87 Difference]: Start difference. First operand 840 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:14,866 INFO L93 Difference]: Finished difference Result 1157 states and 1912 transitions. [2022-04-15 11:47:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 11:47:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-15 11:47:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-15 11:47:14,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 488 transitions. [2022-04-15 11:47:15,179 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-15 11:47:15,207 INFO L225 Difference]: With dead ends: 1157 [2022-04-15 11:47:15,207 INFO L226 Difference]: Without dead ends: 883 [2022-04-15 11:47:15,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:15,208 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 33 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:15,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 613 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 454 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:47:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-04-15 11:47:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 862. [2022-04-15 11:47:15,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:15,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 883 states. Second operand has 862 states, 857 states have (on average 1.6557759626604434) internal successors, (1419), 857 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:15,238 INFO L74 IsIncluded]: Start isIncluded. First operand 883 states. Second operand has 862 states, 857 states have (on average 1.6557759626604434) internal successors, (1419), 857 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:15,239 INFO L87 Difference]: Start difference. First operand 883 states. Second operand has 862 states, 857 states have (on average 1.6557759626604434) internal successors, (1419), 857 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:15,261 INFO L93 Difference]: Finished difference Result 883 states and 1450 transitions. [2022-04-15 11:47:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1450 transitions. [2022-04-15 11:47:15,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:15,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:15,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 862 states, 857 states have (on average 1.6557759626604434) internal successors, (1419), 857 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 883 states. [2022-04-15 11:47:15,263 INFO L87 Difference]: Start difference. First operand has 862 states, 857 states have (on average 1.6557759626604434) internal successors, (1419), 857 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 883 states. [2022-04-15 11:47:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:15,286 INFO L93 Difference]: Finished difference Result 883 states and 1450 transitions. [2022-04-15 11:47:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1450 transitions. [2022-04-15 11:47:15,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:15,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:15,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:15,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 857 states have (on average 1.6557759626604434) internal successors, (1419), 857 states have internal predecessors, (1419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1423 transitions. [2022-04-15 11:47:15,318 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1423 transitions. Word has length 101 [2022-04-15 11:47:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:15,318 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1423 transitions. [2022-04-15 11:47:15,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:15,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 862 states and 1423 transitions. [2022-04-15 11:47:18,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1423 edges. 1422 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1423 transitions. [2022-04-15 11:47:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 11:47:18,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:18,579 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:18,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:47:18,580 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1267586020, now seen corresponding path program 1 times [2022-04-15 11:47:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:18,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907667520] [2022-04-15 11:47:18,634 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:18,634 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:18,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1267586020, now seen corresponding path program 2 times [2022-04-15 11:47:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:18,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004055641] [2022-04-15 11:47:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:18,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {49237#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {49230#true} is VALID [2022-04-15 11:47:18,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {49230#true} assume true; {49230#true} is VALID [2022-04-15 11:47:18,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49230#true} {49230#true} #710#return; {49230#true} is VALID [2022-04-15 11:47:18,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {49230#true} call ULTIMATE.init(); {49237#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:18,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {49237#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {49230#true} is VALID [2022-04-15 11:47:18,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {49230#true} assume true; {49230#true} is VALID [2022-04-15 11:47:18,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49230#true} {49230#true} #710#return; {49230#true} is VALID [2022-04-15 11:47:18,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {49230#true} call #t~ret161 := main(); {49230#true} is VALID [2022-04-15 11:47:18,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {49230#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; {49230#true} is VALID [2022-04-15 11:47:18,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {49230#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,805 INFO L272 TraceCheckUtils]: 7: Hoare triple {49230#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {49230#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); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {49230#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; {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {49230#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; {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {49230#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {49230#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {49230#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {49230#true} assume !false; {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {49230#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); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {49230#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {49230#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {49230#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {49230#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {49230#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {49230#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {49230#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {49230#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49230#true} is VALID [2022-04-15 11:47:18,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {49230#true} assume 8464 == #t~mem55;havoc #t~mem55; {49230#true} is VALID [2022-04-15 11:47:18,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {49230#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; {49230#true} is VALID [2022-04-15 11:47:18,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {49230#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49230#true} is VALID [2022-04-15 11:47:18,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {49230#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); {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {49235#(= 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); {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {49235#(= 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; {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {49235#(= 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); {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {49235#(= 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); {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {49235#(= 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); {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {49235#(= 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); {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {49235#(= 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); {49235#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:18,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {49235#(= 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); {49236#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {49236#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {49231#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; {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {49231#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); {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {49231#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); {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {49231#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {49231#false} ~skip~0 := 0; {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {49231#false} assume !false; {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {49231#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); {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {49231#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {49231#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {49231#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {49231#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {49231#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {49231#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {49231#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 53: Hoare triple {49231#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {49231#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {49231#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {49231#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {49231#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {49231#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {49231#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {49231#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {49231#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 62: Hoare triple {49231#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {49231#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {49231#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {49231#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {49231#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {49231#false} assume 8448 == #t~mem68;havoc #t~mem68; {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {49231#false} assume !(~num1~0 > 0); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {49231#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; {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {49231#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); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 71: Hoare triple {49231#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 72: Hoare triple {49231#false} ~skip~0 := 0; {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 73: Hoare triple {49231#false} assume !false; {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 74: Hoare triple {49231#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); {49231#false} is VALID [2022-04-15 11:47:18,815 INFO L290 TraceCheckUtils]: 75: Hoare triple {49231#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 76: Hoare triple {49231#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 77: Hoare triple {49231#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {49231#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {49231#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {49231#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 81: Hoare triple {49231#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 82: Hoare triple {49231#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 83: Hoare triple {49231#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 84: Hoare triple {49231#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 85: Hoare triple {49231#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 86: Hoare triple {49231#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 87: Hoare triple {49231#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,816 INFO L290 TraceCheckUtils]: 88: Hoare triple {49231#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 89: Hoare triple {49231#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 90: Hoare triple {49231#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 91: Hoare triple {49231#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 92: Hoare triple {49231#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 93: Hoare triple {49231#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 94: Hoare triple {49231#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 95: Hoare triple {49231#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 96: Hoare triple {49231#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {49231#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 98: Hoare triple {49231#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 99: Hoare triple {49231#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 100: Hoare triple {49231#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 101: Hoare triple {49231#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,817 INFO L290 TraceCheckUtils]: 102: Hoare triple {49231#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {49231#false} is VALID [2022-04-15 11:47:18,818 INFO L290 TraceCheckUtils]: 103: Hoare triple {49231#false} assume 8640 == #t~mem75;havoc #t~mem75; {49231#false} is VALID [2022-04-15 11:47:18,818 INFO L290 TraceCheckUtils]: 104: Hoare triple {49231#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {49231#false} is VALID [2022-04-15 11:47:18,818 INFO L290 TraceCheckUtils]: 105: Hoare triple {49231#false} assume !(9 == ~blastFlag~0); {49231#false} is VALID [2022-04-15 11:47:18,818 INFO L290 TraceCheckUtils]: 106: Hoare triple {49231#false} assume 12 == ~blastFlag~0; {49231#false} is VALID [2022-04-15 11:47:18,818 INFO L290 TraceCheckUtils]: 107: Hoare triple {49231#false} assume !false; {49231#false} is VALID [2022-04-15 11:47:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:47:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:18,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004055641] [2022-04-15 11:47:18,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004055641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:18,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:18,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:18,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:18,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907667520] [2022-04-15 11:47:18,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907667520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:18,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:18,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679448750] [2022-04-15 11:47:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 11:47:18,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:18,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:18,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:18,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:18,879 INFO L87 Difference]: Start difference. First operand 862 states and 1423 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:21,811 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-15 11:47:23,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:27,753 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-15 11:47:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:31,709 INFO L93 Difference]: Finished difference Result 1179 states and 1948 transitions. [2022-04-15 11:47:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-15 11:47:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-15 11:47:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-15 11:47:31,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 487 transitions. [2022-04-15 11:47:32,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:32,039 INFO L225 Difference]: With dead ends: 1179 [2022-04-15 11:47:32,039 INFO L226 Difference]: Without dead ends: 883 [2022-04-15 11:47:32,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:32,040 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 38 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:32,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 613 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 454 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-04-15 11:47:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-04-15 11:47:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 862. [2022-04-15 11:47:32,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:32,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 883 states. Second operand has 862 states, 857 states have (on average 1.6546091015169195) internal successors, (1418), 857 states have internal predecessors, (1418), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,070 INFO L74 IsIncluded]: Start isIncluded. First operand 883 states. Second operand has 862 states, 857 states have (on average 1.6546091015169195) internal successors, (1418), 857 states have internal predecessors, (1418), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,071 INFO L87 Difference]: Start difference. First operand 883 states. Second operand has 862 states, 857 states have (on average 1.6546091015169195) internal successors, (1418), 857 states have internal predecessors, (1418), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:32,093 INFO L93 Difference]: Finished difference Result 883 states and 1449 transitions. [2022-04-15 11:47:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1449 transitions. [2022-04-15 11:47:32,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:32,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:32,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 862 states, 857 states have (on average 1.6546091015169195) internal successors, (1418), 857 states have internal predecessors, (1418), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 883 states. [2022-04-15 11:47:32,096 INFO L87 Difference]: Start difference. First operand has 862 states, 857 states have (on average 1.6546091015169195) internal successors, (1418), 857 states have internal predecessors, (1418), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 883 states. [2022-04-15 11:47:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:32,118 INFO L93 Difference]: Finished difference Result 883 states and 1449 transitions. [2022-04-15 11:47:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1449 transitions. [2022-04-15 11:47:32,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:32,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:32,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:32,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 857 states have (on average 1.6546091015169195) internal successors, (1418), 857 states have internal predecessors, (1418), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1422 transitions. [2022-04-15 11:47:32,150 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1422 transitions. Word has length 108 [2022-04-15 11:47:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:32,150 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1422 transitions. [2022-04-15 11:47:32,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 862 states and 1422 transitions. [2022-04-15 11:47:35,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1422 edges. 1421 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1422 transitions. [2022-04-15 11:47:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 11:47:35,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:35,433 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-04-15 11:47:35,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:47:35,434 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:35,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:35,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1455335179, now seen corresponding path program 1 times [2022-04-15 11:47:35,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:35,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159333790] [2022-04-15 11:47:35,481 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:35,481 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:35,481 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1455335179, now seen corresponding path program 2 times [2022-04-15 11:47:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:35,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572576324] [2022-04-15 11:47:35,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:35,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:35,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {55097#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {55090#true} is VALID [2022-04-15 11:47:35,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {55090#true} assume true; {55090#true} is VALID [2022-04-15 11:47:35,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55090#true} {55090#true} #710#return; {55090#true} is VALID [2022-04-15 11:47:35,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {55090#true} call ULTIMATE.init(); {55097#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:35,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {55097#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {55090#true} is VALID [2022-04-15 11:47:35,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {55090#true} assume true; {55090#true} is VALID [2022-04-15 11:47:35,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55090#true} {55090#true} #710#return; {55090#true} is VALID [2022-04-15 11:47:35,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {55090#true} call #t~ret161 := main(); {55090#true} is VALID [2022-04-15 11:47:35,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {55090#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; {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {55090#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L272 TraceCheckUtils]: 7: Hoare triple {55090#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {55090#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); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {55090#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; {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {55090#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; {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {55090#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {55090#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {55090#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {55090#true} assume !false; {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {55090#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); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {55090#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {55090#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {55090#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {55090#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {55090#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {55090#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {55090#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {55090#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55090#true} is VALID [2022-04-15 11:47:35,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {55090#true} assume 8464 == #t~mem55;havoc #t~mem55; {55090#true} is VALID [2022-04-15 11:47:35,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {55090#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; {55090#true} is VALID [2022-04-15 11:47:35,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {55090#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55090#true} is VALID [2022-04-15 11:47:35,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {55090#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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {55095#(= 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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {55095#(= 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; {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {55095#(= 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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {55095#(= 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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {55095#(= 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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {55095#(= 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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {55095#(= 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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {55095#(= 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); {55095#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:35,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {55095#(= 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); {55096#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {55096#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {55091#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; {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {55091#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); {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {55091#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); {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {55091#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {55091#false} ~skip~0 := 0; {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {55091#false} assume !false; {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 46: Hoare triple {55091#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); {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {55091#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {55091#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {55091#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {55091#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {55091#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {55091#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {55091#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {55091#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {55091#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {55091#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {55091#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {55091#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {55091#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {55091#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {55091#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {55091#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {55091#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {55091#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {55091#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {55091#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {55091#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {55091#false} assume 8448 == #t~mem68;havoc #t~mem68; {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {55091#false} assume !(~num1~0 > 0); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {55091#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; {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 71: Hoare triple {55091#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); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 72: Hoare triple {55091#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 73: Hoare triple {55091#false} ~skip~0 := 0; {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 74: Hoare triple {55091#false} assume !false; {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {55091#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); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {55091#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {55091#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 78: Hoare triple {55091#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 79: Hoare triple {55091#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {55091#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 81: Hoare triple {55091#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 82: Hoare triple {55091#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 83: Hoare triple {55091#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {55091#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {55091#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {55091#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {55091#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {55091#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {55091#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 90: Hoare triple {55091#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 91: Hoare triple {55091#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 92: Hoare triple {55091#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 93: Hoare triple {55091#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,658 INFO L290 TraceCheckUtils]: 94: Hoare triple {55091#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 95: Hoare triple {55091#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 96: Hoare triple {55091#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 97: Hoare triple {55091#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 98: Hoare triple {55091#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 99: Hoare triple {55091#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 100: Hoare triple {55091#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 101: Hoare triple {55091#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 102: Hoare triple {55091#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 103: Hoare triple {55091#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 104: Hoare triple {55091#false} assume 8640 == #t~mem75;havoc #t~mem75; {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 105: Hoare triple {55091#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 106: Hoare triple {55091#false} assume !(9 == ~blastFlag~0); {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 107: Hoare triple {55091#false} assume 12 == ~blastFlag~0; {55091#false} is VALID [2022-04-15 11:47:35,659 INFO L290 TraceCheckUtils]: 108: Hoare triple {55091#false} assume !false; {55091#false} is VALID [2022-04-15 11:47:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:47:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:35,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572576324] [2022-04-15 11:47:35,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572576324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:35,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:35,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:35,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:35,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159333790] [2022-04-15 11:47:35,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159333790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:35,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:35,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506456402] [2022-04-15 11:47:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:35,661 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 109 [2022-04-15 11:47:35,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:35,662 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-15 11:47:35,730 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-15 11:47:35,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:35,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:35,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:35,731 INFO L87 Difference]: Start difference. First operand 862 states and 1422 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-15 11:47:39,706 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-15 11:47:41,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:45,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:48,877 INFO L93 Difference]: Finished difference Result 1177 states and 1944 transitions. [2022-04-15 11:47:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:48,877 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 109 [2022-04-15 11:47:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:48,878 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-15 11:47:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-15 11:47:48,880 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-15 11:47:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-15 11:47:48,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-15 11:47:49,174 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-15 11:47:49,204 INFO L225 Difference]: With dead ends: 1177 [2022-04-15 11:47:49,205 INFO L226 Difference]: Without dead ends: 881 [2022-04-15 11:47:49,205 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:49,206 INFO L913 BasicCegarLoop]: 246 mSDtfsCounter, 36 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:49,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 611 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 446 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 11:47:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-04-15 11:47:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 862. [2022-04-15 11:47:49,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:49,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 881 states. Second operand has 862 states, 857 states have (on average 1.6534422403733955) internal successors, (1417), 857 states have internal predecessors, (1417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:49,251 INFO L74 IsIncluded]: Start isIncluded. First operand 881 states. Second operand has 862 states, 857 states have (on average 1.6534422403733955) internal successors, (1417), 857 states have internal predecessors, (1417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:49,252 INFO L87 Difference]: Start difference. First operand 881 states. Second operand has 862 states, 857 states have (on average 1.6534422403733955) internal successors, (1417), 857 states have internal predecessors, (1417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:49,273 INFO L93 Difference]: Finished difference Result 881 states and 1446 transitions. [2022-04-15 11:47:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1446 transitions. [2022-04-15 11:47:49,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:49,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:49,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 862 states, 857 states have (on average 1.6534422403733955) internal successors, (1417), 857 states have internal predecessors, (1417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 881 states. [2022-04-15 11:47:49,276 INFO L87 Difference]: Start difference. First operand has 862 states, 857 states have (on average 1.6534422403733955) internal successors, (1417), 857 states have internal predecessors, (1417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 881 states. [2022-04-15 11:47:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:49,298 INFO L93 Difference]: Finished difference Result 881 states and 1446 transitions. [2022-04-15 11:47:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1446 transitions. [2022-04-15 11:47:49,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:49,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:49,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:49,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 857 states have (on average 1.6534422403733955) internal successors, (1417), 857 states have internal predecessors, (1417), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1421 transitions. [2022-04-15 11:47:49,330 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1421 transitions. Word has length 109 [2022-04-15 11:47:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:49,330 INFO L478 AbstractCegarLoop]: Abstraction has 862 states and 1421 transitions. [2022-04-15 11:47:49,330 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-15 11:47:49,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 862 states and 1421 transitions. [2022-04-15 11:47:52,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1421 edges. 1420 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1421 transitions. [2022-04-15 11:47:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 11:47:52,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:52,581 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:52,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:47:52,581 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1251834250, now seen corresponding path program 1 times [2022-04-15 11:47:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:52,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722169401] [2022-04-15 11:47:52,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:52,652 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:52,652 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1251834250, now seen corresponding path program 2 times [2022-04-15 11:47:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:52,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325242359] [2022-04-15 11:47:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:52,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:52,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {60949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {60942#true} is VALID [2022-04-15 11:47:52,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {60942#true} assume true; {60942#true} is VALID [2022-04-15 11:47:52,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60942#true} {60942#true} #710#return; {60942#true} is VALID [2022-04-15 11:47:52,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {60942#true} call ULTIMATE.init(); {60949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:52,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {60949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {60942#true} is VALID [2022-04-15 11:47:52,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {60942#true} assume true; {60942#true} is VALID [2022-04-15 11:47:52,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60942#true} {60942#true} #710#return; {60942#true} is VALID [2022-04-15 11:47:52,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {60942#true} call #t~ret161 := main(); {60942#true} is VALID [2022-04-15 11:47:52,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {60942#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; {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {60942#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L272 TraceCheckUtils]: 7: Hoare triple {60942#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {60942#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); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {60942#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; {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {60942#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; {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {60942#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {60942#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {60942#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {60942#true} assume !false; {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {60942#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); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {60942#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {60942#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {60942#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {60942#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {60942#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {60942#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {60942#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {60942#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {60942#true} assume 8464 == #t~mem55;havoc #t~mem55; {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {60942#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; {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {60942#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {60942#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); {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {60942#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); {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {60942#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {60942#true} ~skip~0 := 0; {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {60942#true} assume !false; {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {60942#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); {60942#true} is VALID [2022-04-15 11:47:52,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {60942#true} assume 12292 == #t~mem47;havoc #t~mem47; {60942#true} is VALID [2022-04-15 11:47:52,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {60942#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {60942#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {60942#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {60942#true} is VALID [2022-04-15 11:47:52,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {60942#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {60942#true} is VALID [2022-04-15 11:47:52,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {60942#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); {60942#true} is VALID [2022-04-15 11:47:52,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {60942#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {60942#true} is VALID [2022-04-15 11:47:52,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {60942#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); {60942#true} is VALID [2022-04-15 11:47:52,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {60942#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); {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {60947#(= 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); {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {60947#(= 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; {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {60947#(= 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); {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {60947#(= 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); {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {60947#(= 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); {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {60947#(= 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); {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {60947#(= 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); {60947#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {60947#(= 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); {60948#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {60948#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {60943#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {60943#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {60943#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {60943#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {60943#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {60943#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {60943#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {60943#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {60943#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {60943#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {60943#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {60943#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {60943#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {60943#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {60943#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {60943#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {60943#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {60943#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {60943#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {60943#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {60943#false} assume 8608 == #t~mem73;havoc #t~mem73; {60943#false} is VALID [2022-04-15 11:47:52,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {60943#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {60943#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {60943#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); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {60943#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); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {60943#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {60943#false} ~skip~0 := 0; {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {60943#false} assume !false; {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 81: Hoare triple {60943#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); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {60943#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {60943#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {60943#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {60943#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {60943#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 87: Hoare triple {60943#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {60943#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {60943#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {60943#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 91: Hoare triple {60943#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 92: Hoare triple {60943#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 93: Hoare triple {60943#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {60943#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {60943#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 96: Hoare triple {60943#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 97: Hoare triple {60943#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 98: Hoare triple {60943#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 99: Hoare triple {60943#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 100: Hoare triple {60943#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 101: Hoare triple {60943#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {60943#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,858 INFO L290 TraceCheckUtils]: 103: Hoare triple {60943#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 104: Hoare triple {60943#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 105: Hoare triple {60943#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 106: Hoare triple {60943#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 107: Hoare triple {60943#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 108: Hoare triple {60943#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 109: Hoare triple {60943#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 110: Hoare triple {60943#false} assume 8640 == #t~mem75;havoc #t~mem75; {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 111: Hoare triple {60943#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 112: Hoare triple {60943#false} assume !(9 == ~blastFlag~0); {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 113: Hoare triple {60943#false} assume 12 == ~blastFlag~0; {60943#false} is VALID [2022-04-15 11:47:52,859 INFO L290 TraceCheckUtils]: 114: Hoare triple {60943#false} assume !false; {60943#false} is VALID [2022-04-15 11:47:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:47:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:52,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325242359] [2022-04-15 11:47:52,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325242359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:52,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:52,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:52,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:52,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722169401] [2022-04-15 11:47:52,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722169401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:52,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:52,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:52,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286711014] [2022-04-15 11:47:52,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 11:47:52,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:52,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:52,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:52,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:52,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:52,927 INFO L87 Difference]: Start difference. First operand 862 states and 1421 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:54,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:58,758 INFO L93 Difference]: Finished difference Result 1501 states and 2465 transitions. [2022-04-15 11:47:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 11:47:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-15 11:47:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-15 11:47:58,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-15 11:47:59,054 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-15 11:47:59,086 INFO L225 Difference]: With dead ends: 1501 [2022-04-15 11:47:59,086 INFO L226 Difference]: Without dead ends: 927 [2022-04-15 11:47:59,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:59,087 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 21 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:59,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 595 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 405 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:47:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-04-15 11:47:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 894. [2022-04-15 11:47:59,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:59,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 927 states. Second operand has 894 states, 889 states have (on average 1.6501687289088864) internal successors, (1467), 889 states have internal predecessors, (1467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:59,118 INFO L74 IsIncluded]: Start isIncluded. First operand 927 states. Second operand has 894 states, 889 states have (on average 1.6501687289088864) internal successors, (1467), 889 states have internal predecessors, (1467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:59,118 INFO L87 Difference]: Start difference. First operand 927 states. Second operand has 894 states, 889 states have (on average 1.6501687289088864) internal successors, (1467), 889 states have internal predecessors, (1467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:59,142 INFO L93 Difference]: Finished difference Result 927 states and 1512 transitions. [2022-04-15 11:47:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1512 transitions. [2022-04-15 11:47:59,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:59,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:59,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 894 states, 889 states have (on average 1.6501687289088864) internal successors, (1467), 889 states have internal predecessors, (1467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 927 states. [2022-04-15 11:47:59,145 INFO L87 Difference]: Start difference. First operand has 894 states, 889 states have (on average 1.6501687289088864) internal successors, (1467), 889 states have internal predecessors, (1467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 927 states. [2022-04-15 11:47:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:59,169 INFO L93 Difference]: Finished difference Result 927 states and 1512 transitions. [2022-04-15 11:47:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1512 transitions. [2022-04-15 11:47:59,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:59,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:59,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:59,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 889 states have (on average 1.6501687289088864) internal successors, (1467), 889 states have internal predecessors, (1467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1471 transitions. [2022-04-15 11:47:59,204 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1471 transitions. Word has length 115 [2022-04-15 11:47:59,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:59,204 INFO L478 AbstractCegarLoop]: Abstraction has 894 states and 1471 transitions. [2022-04-15 11:47:59,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:59,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 894 states and 1471 transitions. [2022-04-15 11:48:02,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1471 edges. 1470 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1471 transitions. [2022-04-15 11:48:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 11:48:02,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:02,574 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:02,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:48:02,574 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:02,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1810474558, now seen corresponding path program 1 times [2022-04-15 11:48:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:02,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1348744894] [2022-04-15 11:48:02,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:02,636 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:02,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1810474558, now seen corresponding path program 2 times [2022-04-15 11:48:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469018034] [2022-04-15 11:48:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:02,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {67605#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {67598#true} is VALID [2022-04-15 11:48:02,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {67598#true} assume true; {67598#true} is VALID [2022-04-15 11:48:02,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67598#true} {67598#true} #710#return; {67598#true} is VALID [2022-04-15 11:48:02,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {67598#true} call ULTIMATE.init(); {67605#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:02,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {67605#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {67598#true} is VALID [2022-04-15 11:48:02,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {67598#true} assume true; {67598#true} is VALID [2022-04-15 11:48:02,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67598#true} {67598#true} #710#return; {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {67598#true} call #t~ret161 := main(); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {67598#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; {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {67598#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L272 TraceCheckUtils]: 7: Hoare triple {67598#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {67598#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); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {67598#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; {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {67598#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; {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {67598#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {67598#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {67598#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {67598#true} assume !false; {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {67598#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); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {67598#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {67598#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {67598#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {67598#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {67598#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {67598#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {67598#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {67598#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {67598#true} assume 8464 == #t~mem55;havoc #t~mem55; {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {67598#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; {67598#true} is VALID [2022-04-15 11:48:02,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {67598#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67598#true} is VALID [2022-04-15 11:48:02,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {67598#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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {67603#(= 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; {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {67603#(= 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); {67603#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:02,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {67603#(= 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); {67604#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {67604#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {67599#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {67599#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); {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {67599#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {67599#false} ~skip~0 := 0; {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {67599#false} assume !false; {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {67599#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); {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {67599#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {67599#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {67599#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {67599#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {67599#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {67599#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {67599#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {67599#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {67599#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {67599#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {67599#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {67599#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {67599#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {67599#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {67599#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {67599#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {67599#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {67599#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {67599#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {67599#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {67599#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {67599#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {67599#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {67599#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {67599#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 72: Hoare triple {67599#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {67599#false} assume 8608 == #t~mem73;havoc #t~mem73; {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {67599#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {67599#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {67599#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); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {67599#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); {67599#false} is VALID [2022-04-15 11:48:02,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {67599#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {67599#false} ~skip~0 := 0; {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {67599#false} assume !false; {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {67599#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); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {67599#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {67599#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {67599#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {67599#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {67599#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 87: Hoare triple {67599#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 88: Hoare triple {67599#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 89: Hoare triple {67599#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {67599#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 91: Hoare triple {67599#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {67599#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {67599#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {67599#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {67599#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {67599#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {67599#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {67599#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 99: Hoare triple {67599#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {67599#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {67599#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {67599#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {67599#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {67599#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 105: Hoare triple {67599#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 106: Hoare triple {67599#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,824 INFO L290 TraceCheckUtils]: 107: Hoare triple {67599#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L290 TraceCheckUtils]: 108: Hoare triple {67599#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L290 TraceCheckUtils]: 109: Hoare triple {67599#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L290 TraceCheckUtils]: 110: Hoare triple {67599#false} assume 8640 == #t~mem75;havoc #t~mem75; {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L290 TraceCheckUtils]: 111: Hoare triple {67599#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L290 TraceCheckUtils]: 112: Hoare triple {67599#false} assume !(9 == ~blastFlag~0); {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L290 TraceCheckUtils]: 113: Hoare triple {67599#false} assume 12 == ~blastFlag~0; {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L290 TraceCheckUtils]: 114: Hoare triple {67599#false} assume !false; {67599#false} is VALID [2022-04-15 11:48:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:48:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:02,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469018034] [2022-04-15 11:48:02,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469018034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:02,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:02,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:02,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:02,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1348744894] [2022-04-15 11:48:02,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1348744894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:02,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:02,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531275816] [2022-04-15 11:48:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:02,827 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 115 [2022-04-15 11:48:02,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:02,827 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-15 11:48:02,880 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-15 11:48:02,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:02,881 INFO L87 Difference]: Start difference. First operand 894 states and 1471 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-15 11:48:06,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:09,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:14,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:16,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:19,823 INFO L93 Difference]: Finished difference Result 1224 states and 2016 transitions. [2022-04-15 11:48:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:19,824 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 115 [2022-04-15 11:48:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:19,824 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-15 11:48:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2022-04-15 11:48:19,826 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-15 11:48:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2022-04-15 11:48:19,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 482 transitions. [2022-04-15 11:48:20,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:20,154 INFO L225 Difference]: With dead ends: 1224 [2022-04-15 11:48:20,154 INFO L226 Difference]: Without dead ends: 912 [2022-04-15 11:48:20,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:20,155 INFO L913 BasicCegarLoop]: 245 mSDtfsCounter, 34 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:20,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 609 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2022-04-15 11:48:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-04-15 11:48:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 894. [2022-04-15 11:48:20,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:20,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 912 states. Second operand has 894 states, 889 states have (on average 1.6490438695163105) internal successors, (1466), 889 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:20,186 INFO L74 IsIncluded]: Start isIncluded. First operand 912 states. Second operand has 894 states, 889 states have (on average 1.6490438695163105) internal successors, (1466), 889 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:20,186 INFO L87 Difference]: Start difference. First operand 912 states. Second operand has 894 states, 889 states have (on average 1.6490438695163105) internal successors, (1466), 889 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:20,209 INFO L93 Difference]: Finished difference Result 912 states and 1494 transitions. [2022-04-15 11:48:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1494 transitions. [2022-04-15 11:48:20,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:20,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:20,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 894 states, 889 states have (on average 1.6490438695163105) internal successors, (1466), 889 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 912 states. [2022-04-15 11:48:20,212 INFO L87 Difference]: Start difference. First operand has 894 states, 889 states have (on average 1.6490438695163105) internal successors, (1466), 889 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 912 states. [2022-04-15 11:48:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:20,235 INFO L93 Difference]: Finished difference Result 912 states and 1494 transitions. [2022-04-15 11:48:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1494 transitions. [2022-04-15 11:48:20,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:20,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:20,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:20,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 889 states have (on average 1.6490438695163105) internal successors, (1466), 889 states have internal predecessors, (1466), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1470 transitions. [2022-04-15 11:48:20,277 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1470 transitions. Word has length 115 [2022-04-15 11:48:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:20,277 INFO L478 AbstractCegarLoop]: Abstraction has 894 states and 1470 transitions. [2022-04-15 11:48:20,277 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-15 11:48:20,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 894 states and 1470 transitions. [2022-04-15 11:48:23,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1470 edges. 1469 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1470 transitions. [2022-04-15 11:48:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 11:48:23,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:23,645 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:23,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:48:23,645 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1335655467, now seen corresponding path program 1 times [2022-04-15 11:48:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:23,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916418919] [2022-04-15 11:48:23,701 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:23,701 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:23,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1335655467, now seen corresponding path program 2 times [2022-04-15 11:48:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:23,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638588175] [2022-04-15 11:48:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:23,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {73678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {73670#true} is VALID [2022-04-15 11:48:23,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {73670#true} assume true; {73670#true} is VALID [2022-04-15 11:48:23,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73670#true} {73670#true} #710#return; {73670#true} is VALID [2022-04-15 11:48:23,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {73670#true} call ULTIMATE.init(); {73678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {73678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {73670#true} assume true; {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73670#true} {73670#true} #710#return; {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {73670#true} call #t~ret161 := main(); {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {73670#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; {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {73670#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L272 TraceCheckUtils]: 7: Hoare triple {73670#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {73670#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); {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {73670#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; {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {73670#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; {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {73670#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {73670#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {73670#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {73670#true} is VALID [2022-04-15 11:48:23,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {73670#true} assume !false; {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {73670#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); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {73670#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {73670#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {73670#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {73670#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {73670#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {73670#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {73670#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {73670#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {73670#true} assume 8464 == #t~mem55;havoc #t~mem55; {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {73670#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; {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {73670#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {73670#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); {73670#true} is VALID [2022-04-15 11:48:23,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {73670#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); {73670#true} is VALID [2022-04-15 11:48:23,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {73670#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73670#true} is VALID [2022-04-15 11:48:23,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {73670#true} ~skip~0 := 0; {73670#true} is VALID [2022-04-15 11:48:23,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {73670#true} assume !false; {73670#true} is VALID [2022-04-15 11:48:23,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {73670#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); {73675#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {73675#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {73676#(= 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); {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {73676#(= 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; {73676#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:23,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {73676#(= 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); {73677#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-15 11:48:23,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {73677#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {73671#false} is VALID [2022-04-15 11:48:23,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {73671#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; {73671#false} is VALID [2022-04-15 11:48:23,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {73671#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); {73671#false} is VALID [2022-04-15 11:48:23,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {73671#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {73671#false} ~skip~0 := 0; {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {73671#false} assume !false; {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {73671#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); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {73671#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {73671#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {73671#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {73671#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {73671#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {73671#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 54: Hoare triple {73671#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 55: Hoare triple {73671#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {73671#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {73671#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,941 INFO L290 TraceCheckUtils]: 58: Hoare triple {73671#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {73671#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {73671#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {73671#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {73671#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {73671#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 64: Hoare triple {73671#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {73671#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 66: Hoare triple {73671#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {73671#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {73671#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {73671#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {73671#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 71: Hoare triple {73671#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 72: Hoare triple {73671#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,942 INFO L290 TraceCheckUtils]: 73: Hoare triple {73671#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 74: Hoare triple {73671#false} assume 8608 == #t~mem73;havoc #t~mem73; {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 75: Hoare triple {73671#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {73671#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {73671#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); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {73671#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); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 79: Hoare triple {73671#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 80: Hoare triple {73671#false} ~skip~0 := 0; {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 81: Hoare triple {73671#false} assume !false; {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 82: Hoare triple {73671#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); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 83: Hoare triple {73671#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 84: Hoare triple {73671#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 85: Hoare triple {73671#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 86: Hoare triple {73671#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,943 INFO L290 TraceCheckUtils]: 87: Hoare triple {73671#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 88: Hoare triple {73671#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 89: Hoare triple {73671#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 90: Hoare triple {73671#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 91: Hoare triple {73671#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {73671#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {73671#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {73671#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {73671#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 96: Hoare triple {73671#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 97: Hoare triple {73671#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 98: Hoare triple {73671#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 99: Hoare triple {73671#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 100: Hoare triple {73671#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 101: Hoare triple {73671#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,944 INFO L290 TraceCheckUtils]: 102: Hoare triple {73671#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 103: Hoare triple {73671#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 104: Hoare triple {73671#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {73671#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {73671#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 107: Hoare triple {73671#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 108: Hoare triple {73671#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 109: Hoare triple {73671#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 110: Hoare triple {73671#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 111: Hoare triple {73671#false} assume 8640 == #t~mem75;havoc #t~mem75; {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 112: Hoare triple {73671#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 113: Hoare triple {73671#false} assume !(9 == ~blastFlag~0); {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 114: Hoare triple {73671#false} assume 12 == ~blastFlag~0; {73671#false} is VALID [2022-04-15 11:48:23,945 INFO L290 TraceCheckUtils]: 115: Hoare triple {73671#false} assume !false; {73671#false} is VALID [2022-04-15 11:48:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-15 11:48:23,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:23,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638588175] [2022-04-15 11:48:23,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638588175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:23,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:23,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:48:23,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:23,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916418919] [2022-04-15 11:48:23,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916418919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:23,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:23,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:48:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784763186] [2022-04-15 11:48:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:23,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 11:48:23,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:23,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:24,009 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-15 11:48:24,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:48:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:24,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:48:24,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:24,010 INFO L87 Difference]: Start difference. First operand 894 states and 1470 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:26,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:30,203 INFO L93 Difference]: Finished difference Result 1518 states and 2494 transitions. [2022-04-15 11:48:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:48:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 11:48:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2022-04-15 11:48:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2022-04-15 11:48:30,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 435 transitions. [2022-04-15 11:48:30,473 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-15 11:48:30,503 INFO L225 Difference]: With dead ends: 1518 [2022-04-15 11:48:30,503 INFO L226 Difference]: Without dead ends: 912 [2022-04-15 11:48:30,504 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-15 11:48:30,504 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:30,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 682 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 456 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:48:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-04-15 11:48:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2022-04-15 11:48:30,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:30,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 912 states. Second operand has 912 states, 907 states have (on average 1.6405733186328555) internal successors, (1488), 907 states have internal predecessors, (1488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,535 INFO L74 IsIncluded]: Start isIncluded. First operand 912 states. Second operand has 912 states, 907 states have (on average 1.6405733186328555) internal successors, (1488), 907 states have internal predecessors, (1488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,535 INFO L87 Difference]: Start difference. First operand 912 states. Second operand has 912 states, 907 states have (on average 1.6405733186328555) internal successors, (1488), 907 states have internal predecessors, (1488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:30,558 INFO L93 Difference]: Finished difference Result 912 states and 1492 transitions. [2022-04-15 11:48:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1492 transitions. [2022-04-15 11:48:30,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:30,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:30,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 907 states have (on average 1.6405733186328555) internal successors, (1488), 907 states have internal predecessors, (1488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 912 states. [2022-04-15 11:48:30,561 INFO L87 Difference]: Start difference. First operand has 912 states, 907 states have (on average 1.6405733186328555) internal successors, (1488), 907 states have internal predecessors, (1488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 912 states. [2022-04-15 11:48:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:30,584 INFO L93 Difference]: Finished difference Result 912 states and 1492 transitions. [2022-04-15 11:48:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1492 transitions. [2022-04-15 11:48:30,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:30,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:30,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:30,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 907 states have (on average 1.6405733186328555) internal successors, (1488), 907 states have internal predecessors, (1488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1492 transitions. [2022-04-15 11:48:30,619 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1492 transitions. Word has length 116 [2022-04-15 11:48:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:30,619 INFO L478 AbstractCegarLoop]: Abstraction has 912 states and 1492 transitions. [2022-04-15 11:48:30,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1492 transitions. [2022-04-15 11:48:33,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1492 edges. 1491 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1492 transitions. [2022-04-15 11:48:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 11:48:33,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:33,973 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:33,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:48:33,973 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash 485213310, now seen corresponding path program 1 times [2022-04-15 11:48:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:33,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275586962] [2022-04-15 11:48:34,051 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:34,051 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:34,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash 485213310, now seen corresponding path program 2 times [2022-04-15 11:48:34,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:34,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891918141] [2022-04-15 11:48:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:34,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {80374#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {80367#true} is VALID [2022-04-15 11:48:34,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {80367#true} assume true; {80367#true} is VALID [2022-04-15 11:48:34,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80367#true} {80367#true} #710#return; {80367#true} is VALID [2022-04-15 11:48:34,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {80367#true} call ULTIMATE.init(); {80374#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:34,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {80374#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {80367#true} is VALID [2022-04-15 11:48:34,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {80367#true} assume true; {80367#true} is VALID [2022-04-15 11:48:34,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80367#true} {80367#true} #710#return; {80367#true} is VALID [2022-04-15 11:48:34,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {80367#true} call #t~ret161 := main(); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {80367#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; {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {80367#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L272 TraceCheckUtils]: 7: Hoare triple {80367#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {80367#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); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {80367#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; {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {80367#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; {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {80367#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {80367#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {80367#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {80367#true} assume !false; {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {80367#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); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {80367#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {80367#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {80367#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {80367#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {80367#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {80367#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {80367#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {80367#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {80367#true} assume 8464 == #t~mem55;havoc #t~mem55; {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {80367#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; {80367#true} is VALID [2022-04-15 11:48:34,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {80367#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {80367#true} is VALID [2022-04-15 11:48:34,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {80367#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); {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:34,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {80372#(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); {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:34,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {80372#(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; {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:34,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:34,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:34,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {80372#(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); {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:34,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {80372#(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); {80372#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {80372#(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); {80373#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {80373#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {80368#false} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {80368#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {80368#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {80368#false} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {80368#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {80368#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); {80368#false} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {80368#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {80368#false} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {80368#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); {80368#false} is VALID [2022-04-15 11:48:34,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {80368#false} assume 12292 != #t~mem85;havoc #t~mem85; {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {80368#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; {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {80368#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); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {80368#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {80368#false} ~skip~0 := 0; {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {80368#false} assume !false; {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {80368#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); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {80368#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {80368#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {80368#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {80368#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {80368#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {80368#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {80368#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {80368#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {80368#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {80368#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {80368#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {80368#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {80368#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {80368#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {80368#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 64: Hoare triple {80368#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {80368#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {80368#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {80368#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 68: Hoare triple {80368#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 69: Hoare triple {80368#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {80368#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {80368#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {80368#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {80368#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {80368#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {80368#false} assume 8608 == #t~mem73;havoc #t~mem73; {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {80368#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 77: Hoare triple {80368#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 78: Hoare triple {80368#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); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 79: Hoare triple {80368#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); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 80: Hoare triple {80368#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 81: Hoare triple {80368#false} ~skip~0 := 0; {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 82: Hoare triple {80368#false} assume !false; {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {80368#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); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {80368#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,230 INFO L290 TraceCheckUtils]: 85: Hoare triple {80368#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 86: Hoare triple {80368#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 87: Hoare triple {80368#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 88: Hoare triple {80368#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 89: Hoare triple {80368#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 90: Hoare triple {80368#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 91: Hoare triple {80368#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {80368#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 93: Hoare triple {80368#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 94: Hoare triple {80368#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 95: Hoare triple {80368#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 96: Hoare triple {80368#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 97: Hoare triple {80368#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,231 INFO L290 TraceCheckUtils]: 98: Hoare triple {80368#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 99: Hoare triple {80368#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 100: Hoare triple {80368#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 101: Hoare triple {80368#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 102: Hoare triple {80368#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 103: Hoare triple {80368#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 104: Hoare triple {80368#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 105: Hoare triple {80368#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 106: Hoare triple {80368#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 107: Hoare triple {80368#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 108: Hoare triple {80368#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 109: Hoare triple {80368#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 110: Hoare triple {80368#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 111: Hoare triple {80368#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 112: Hoare triple {80368#false} assume 8640 == #t~mem75;havoc #t~mem75; {80368#false} is VALID [2022-04-15 11:48:34,232 INFO L290 TraceCheckUtils]: 113: Hoare triple {80368#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {80368#false} is VALID [2022-04-15 11:48:34,233 INFO L290 TraceCheckUtils]: 114: Hoare triple {80368#false} assume !(9 == ~blastFlag~0); {80368#false} is VALID [2022-04-15 11:48:34,233 INFO L290 TraceCheckUtils]: 115: Hoare triple {80368#false} assume 12 == ~blastFlag~0; {80368#false} is VALID [2022-04-15 11:48:34,233 INFO L290 TraceCheckUtils]: 116: Hoare triple {80368#false} assume !false; {80368#false} is VALID [2022-04-15 11:48:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:48:34,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:34,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891918141] [2022-04-15 11:48:34,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891918141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:34,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:34,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:34,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275586962] [2022-04-15 11:48:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275586962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:34,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215196451] [2022-04-15 11:48:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:34,234 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 117 [2022-04-15 11:48:34,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:34,235 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-15 11:48:34,291 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-15 11:48:34,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:34,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:34,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:34,292 INFO L87 Difference]: Start difference. First operand 912 states and 1492 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-15 11:48:36,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:40,243 INFO L93 Difference]: Finished difference Result 1792 states and 2858 transitions. [2022-04-15 11:48:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:40,243 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 117 [2022-04-15 11:48:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:40,243 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-15 11:48:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-15 11:48:40,246 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-15 11:48:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-15 11:48:40,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 613 transitions. [2022-04-15 11:48:40,652 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-15 11:48:40,700 INFO L225 Difference]: With dead ends: 1792 [2022-04-15 11:48:40,700 INFO L226 Difference]: Without dead ends: 1166 [2022-04-15 11:48:40,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:40,702 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:40,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 374 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:48:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-04-15 11:48:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 912. [2022-04-15 11:48:40,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:40,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1166 states. Second operand has 912 states, 907 states have (on average 1.6240352811466372) internal successors, (1473), 907 states have internal predecessors, (1473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:40,736 INFO L74 IsIncluded]: Start isIncluded. First operand 1166 states. Second operand has 912 states, 907 states have (on average 1.6240352811466372) internal successors, (1473), 907 states have internal predecessors, (1473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:40,736 INFO L87 Difference]: Start difference. First operand 1166 states. Second operand has 912 states, 907 states have (on average 1.6240352811466372) internal successors, (1473), 907 states have internal predecessors, (1473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:40,771 INFO L93 Difference]: Finished difference Result 1166 states and 1818 transitions. [2022-04-15 11:48:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1818 transitions. [2022-04-15 11:48:40,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:40,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:40,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 907 states have (on average 1.6240352811466372) internal successors, (1473), 907 states have internal predecessors, (1473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1166 states. [2022-04-15 11:48:40,774 INFO L87 Difference]: Start difference. First operand has 912 states, 907 states have (on average 1.6240352811466372) internal successors, (1473), 907 states have internal predecessors, (1473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1166 states. [2022-04-15 11:48:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:40,809 INFO L93 Difference]: Finished difference Result 1166 states and 1818 transitions. [2022-04-15 11:48:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1818 transitions. [2022-04-15 11:48:40,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:40,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:40,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:40,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 907 states have (on average 1.6240352811466372) internal successors, (1473), 907 states have internal predecessors, (1473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1477 transitions. [2022-04-15 11:48:40,844 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1477 transitions. Word has length 117 [2022-04-15 11:48:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:40,844 INFO L478 AbstractCegarLoop]: Abstraction has 912 states and 1477 transitions. [2022-04-15 11:48:40,844 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-15 11:48:40,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1477 transitions. [2022-04-15 11:48:44,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1477 edges. 1476 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1477 transitions. [2022-04-15 11:48:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:48:44,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:44,228 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:44,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:48:44,228 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1958971758, now seen corresponding path program 1 times [2022-04-15 11:48:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:44,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [295285963] [2022-04-15 11:48:44,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:44,291 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:44,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1958971758, now seen corresponding path program 2 times [2022-04-15 11:48:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164837075] [2022-04-15 11:48:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:44,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:44,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {88126#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {88119#true} is VALID [2022-04-15 11:48:44,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {88119#true} assume true; {88119#true} is VALID [2022-04-15 11:48:44,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88119#true} {88119#true} #710#return; {88119#true} is VALID [2022-04-15 11:48:44,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {88119#true} call ULTIMATE.init(); {88126#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:44,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {88126#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {88119#true} is VALID [2022-04-15 11:48:44,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {88119#true} assume true; {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88119#true} {88119#true} #710#return; {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {88119#true} call #t~ret161 := main(); {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {88119#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; {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {88119#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L272 TraceCheckUtils]: 7: Hoare triple {88119#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {88119#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); {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {88119#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; {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {88119#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; {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {88119#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {88119#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {88119#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {88119#true} assume !false; {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {88119#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); {88119#true} is VALID [2022-04-15 11:48:44,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {88119#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {88119#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {88119#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {88119#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {88119#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {88119#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {88119#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {88119#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {88119#true} assume 8464 == #t~mem55;havoc #t~mem55; {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {88119#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; {88119#true} is VALID [2022-04-15 11:48:44,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {88119#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {88119#true} is VALID [2022-04-15 11:48:44,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {88119#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); {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {88124#(= 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); {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {88124#(= 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; {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {88124#(= 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); {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {88124#(= 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); {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {88124#(= 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); {88124#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:44,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {88124#(= 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); {88125#(= |ssl3_accept_#t~mem50| 8496)} is VALID [2022-04-15 11:48:44,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {88125#(= |ssl3_accept_#t~mem50| 8496)} assume 24576 == #t~mem50;havoc #t~mem50; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {88120#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {88120#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {88120#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {88120#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); {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {88120#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {88120#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); {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {88120#false} assume 12292 != #t~mem85;havoc #t~mem85; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {88120#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; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {88120#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); {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {88120#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {88120#false} ~skip~0 := 0; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {88120#false} assume !false; {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {88120#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); {88120#false} is VALID [2022-04-15 11:48:44,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {88120#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {88120#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {88120#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {88120#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {88120#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 55: Hoare triple {88120#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {88120#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {88120#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {88120#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {88120#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {88120#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {88120#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {88120#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {88120#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {88120#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {88120#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 66: Hoare triple {88120#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {88120#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {88120#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 69: Hoare triple {88120#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {88120#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {88120#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {88120#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {88120#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {88120#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {88120#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {88120#false} assume 8608 == #t~mem73;havoc #t~mem73; {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {88120#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {88120#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {88120#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); {88120#false} is VALID [2022-04-15 11:48:44,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {88120#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); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {88120#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {88120#false} ~skip~0 := 0; {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {88120#false} assume !false; {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 84: Hoare triple {88120#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); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 85: Hoare triple {88120#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {88120#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {88120#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {88120#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 89: Hoare triple {88120#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 90: Hoare triple {88120#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 91: Hoare triple {88120#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 92: Hoare triple {88120#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {88120#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,470 INFO L290 TraceCheckUtils]: 94: Hoare triple {88120#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 95: Hoare triple {88120#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {88120#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 97: Hoare triple {88120#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 98: Hoare triple {88120#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 99: Hoare triple {88120#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 100: Hoare triple {88120#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 101: Hoare triple {88120#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 102: Hoare triple {88120#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 103: Hoare triple {88120#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 104: Hoare triple {88120#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 105: Hoare triple {88120#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 106: Hoare triple {88120#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 107: Hoare triple {88120#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,471 INFO L290 TraceCheckUtils]: 108: Hoare triple {88120#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 109: Hoare triple {88120#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 110: Hoare triple {88120#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 111: Hoare triple {88120#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 112: Hoare triple {88120#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 113: Hoare triple {88120#false} assume 8640 == #t~mem75;havoc #t~mem75; {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 114: Hoare triple {88120#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 115: Hoare triple {88120#false} assume !(9 == ~blastFlag~0); {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 116: Hoare triple {88120#false} assume 12 == ~blastFlag~0; {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L290 TraceCheckUtils]: 117: Hoare triple {88120#false} assume !false; {88120#false} is VALID [2022-04-15 11:48:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:48:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:44,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164837075] [2022-04-15 11:48:44,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164837075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:44,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:44,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:44,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:44,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [295285963] [2022-04-15 11:48:44,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [295285963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:44,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:44,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600324339] [2022-04-15 11:48:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:48:44,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:44,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:44,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:44,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:44,530 INFO L87 Difference]: Start difference. First operand 912 states and 1477 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:49,956 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-15 11:48:53,797 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-15 11:49:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:00,535 INFO L93 Difference]: Finished difference Result 1260 states and 2037 transitions. [2022-04-15 11:49:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:00,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:49:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:49:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-15 11:49:00,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-15 11:49:00,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:00,862 INFO L225 Difference]: With dead ends: 1260 [2022-04-15 11:49:00,862 INFO L226 Difference]: Without dead ends: 939 [2022-04-15 11:49:00,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:00,863 INFO L913 BasicCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:00,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 605 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:49:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-04-15 11:49:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 912. [2022-04-15 11:49:00,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:00,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 939 states. Second operand has 912 states, 907 states have (on average 1.6229327453142226) internal successors, (1472), 907 states have internal predecessors, (1472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:00,904 INFO L74 IsIncluded]: Start isIncluded. First operand 939 states. Second operand has 912 states, 907 states have (on average 1.6229327453142226) internal successors, (1472), 907 states have internal predecessors, (1472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:00,905 INFO L87 Difference]: Start difference. First operand 939 states. Second operand has 912 states, 907 states have (on average 1.6229327453142226) internal successors, (1472), 907 states have internal predecessors, (1472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:00,929 INFO L93 Difference]: Finished difference Result 939 states and 1511 transitions. [2022-04-15 11:49:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1511 transitions. [2022-04-15 11:49:00,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:00,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:00,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 907 states have (on average 1.6229327453142226) internal successors, (1472), 907 states have internal predecessors, (1472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 939 states. [2022-04-15 11:49:00,931 INFO L87 Difference]: Start difference. First operand has 912 states, 907 states have (on average 1.6229327453142226) internal successors, (1472), 907 states have internal predecessors, (1472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 939 states. [2022-04-15 11:49:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:00,956 INFO L93 Difference]: Finished difference Result 939 states and 1511 transitions. [2022-04-15 11:49:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1511 transitions. [2022-04-15 11:49:00,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:00,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:00,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:00,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 907 states have (on average 1.6229327453142226) internal successors, (1472), 907 states have internal predecessors, (1472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1476 transitions. [2022-04-15 11:49:00,990 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1476 transitions. Word has length 118 [2022-04-15 11:49:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:00,990 INFO L478 AbstractCegarLoop]: Abstraction has 912 states and 1476 transitions. [2022-04-15 11:49:00,990 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:00,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1476 transitions. [2022-04-15 11:49:04,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1476 edges. 1475 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1476 transitions. [2022-04-15 11:49:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 11:49:04,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:04,327 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:04,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:49:04,327 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -797369959, now seen corresponding path program 1 times [2022-04-15 11:49:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:04,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12028236] [2022-04-15 11:49:04,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:04,416 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:04,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash -797369959, now seen corresponding path program 2 times [2022-04-15 11:49:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:04,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112667541] [2022-04-15 11:49:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:04,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {94360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {94353#true} is VALID [2022-04-15 11:49:04,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {94353#true} assume true; {94353#true} is VALID [2022-04-15 11:49:04,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94353#true} {94353#true} #710#return; {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {94353#true} call ULTIMATE.init(); {94360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:04,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {94360#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {94353#true} assume true; {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94353#true} {94353#true} #710#return; {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {94353#true} call #t~ret161 := main(); {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {94353#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; {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {94353#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L272 TraceCheckUtils]: 7: Hoare triple {94353#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {94353#true} is VALID [2022-04-15 11:49:04,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {94353#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); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {94353#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; {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {94353#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; {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {94353#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {94353#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {94353#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {94353#true} assume !false; {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {94353#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); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {94353#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {94353#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {94353#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {94353#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {94353#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {94353#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {94353#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {94353#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94353#true} is VALID [2022-04-15 11:49:04,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {94353#true} assume 8464 == #t~mem55;havoc #t~mem55; {94353#true} is VALID [2022-04-15 11:49:04,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {94353#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; {94353#true} is VALID [2022-04-15 11:49:04,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {94353#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {94353#true} is VALID [2022-04-15 11:49:04,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {94353#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); {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {94358#(= 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); {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {94358#(= 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; {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {94358#(= 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); {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {94358#(= 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); {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {94358#(= 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); {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {94358#(= 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); {94358#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:04,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {94358#(= 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); {94359#(= |ssl3_accept_#t~mem51| 8496)} is VALID [2022-04-15 11:49:04,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {94359#(= |ssl3_accept_#t~mem51| 8496)} assume 8195 == #t~mem51;havoc #t~mem51; {94354#false} is VALID [2022-04-15 11:49:04,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {94354#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {94354#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {94354#false} is VALID [2022-04-15 11:49:04,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {94354#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {94354#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); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {94354#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {94354#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); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {94354#false} assume 12292 != #t~mem85;havoc #t~mem85; {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {94354#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; {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {94354#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); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {94354#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {94354#false} ~skip~0 := 0; {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {94354#false} assume !false; {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {94354#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); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {94354#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {94354#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {94354#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {94354#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {94354#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {94354#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {94354#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {94354#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {94354#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {94354#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {94354#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 62: Hoare triple {94354#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 63: Hoare triple {94354#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {94354#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {94354#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {94354#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {94354#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {94354#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {94354#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 70: Hoare triple {94354#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 71: Hoare triple {94354#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 72: Hoare triple {94354#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 73: Hoare triple {94354#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 74: Hoare triple {94354#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 75: Hoare triple {94354#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 76: Hoare triple {94354#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 77: Hoare triple {94354#false} assume 8608 == #t~mem73;havoc #t~mem73; {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 78: Hoare triple {94354#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 79: Hoare triple {94354#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 80: Hoare triple {94354#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); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 81: Hoare triple {94354#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); {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 82: Hoare triple {94354#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {94354#false} ~skip~0 := 0; {94354#false} is VALID [2022-04-15 11:49:04,600 INFO L290 TraceCheckUtils]: 84: Hoare triple {94354#false} assume !false; {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 85: Hoare triple {94354#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); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 86: Hoare triple {94354#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 87: Hoare triple {94354#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 88: Hoare triple {94354#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 89: Hoare triple {94354#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 90: Hoare triple {94354#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 91: Hoare triple {94354#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {94354#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {94354#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 94: Hoare triple {94354#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {94354#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 96: Hoare triple {94354#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 97: Hoare triple {94354#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {94354#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 99: Hoare triple {94354#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {94354#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 101: Hoare triple {94354#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 102: Hoare triple {94354#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 103: Hoare triple {94354#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 104: Hoare triple {94354#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 105: Hoare triple {94354#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 106: Hoare triple {94354#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 107: Hoare triple {94354#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 108: Hoare triple {94354#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 109: Hoare triple {94354#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 110: Hoare triple {94354#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 111: Hoare triple {94354#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,602 INFO L290 TraceCheckUtils]: 112: Hoare triple {94354#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,603 INFO L290 TraceCheckUtils]: 113: Hoare triple {94354#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {94354#false} is VALID [2022-04-15 11:49:04,603 INFO L290 TraceCheckUtils]: 114: Hoare triple {94354#false} assume 8640 == #t~mem75;havoc #t~mem75; {94354#false} is VALID [2022-04-15 11:49:04,603 INFO L290 TraceCheckUtils]: 115: Hoare triple {94354#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {94354#false} is VALID [2022-04-15 11:49:04,603 INFO L290 TraceCheckUtils]: 116: Hoare triple {94354#false} assume !(9 == ~blastFlag~0); {94354#false} is VALID [2022-04-15 11:49:04,603 INFO L290 TraceCheckUtils]: 117: Hoare triple {94354#false} assume 12 == ~blastFlag~0; {94354#false} is VALID [2022-04-15 11:49:04,603 INFO L290 TraceCheckUtils]: 118: Hoare triple {94354#false} assume !false; {94354#false} is VALID [2022-04-15 11:49:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 11:49:04,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112667541] [2022-04-15 11:49:04,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112667541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:04,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:04,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:04,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12028236] [2022-04-15 11:49:04,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12028236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:04,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:04,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39281476] [2022-04-15 11:49:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:04,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 11:49:04,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:04,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:04,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:04,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:04,666 INFO L87 Difference]: Start difference. First operand 912 states and 1476 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:07,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:12,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:15,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:19,134 INFO L93 Difference]: Finished difference Result 1250 states and 2022 transitions. [2022-04-15 11:49:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 11:49:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:49:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:49:19,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-15 11:49:19,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:19,457 INFO L225 Difference]: With dead ends: 1250 [2022-04-15 11:49:19,457 INFO L226 Difference]: Without dead ends: 929 [2022-04-15 11:49:19,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:19,458 INFO L913 BasicCegarLoop]: 241 mSDtfsCounter, 33 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:19,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 601 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 433 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:49:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-04-15 11:49:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 912. [2022-04-15 11:49:19,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:19,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 929 states. Second operand has 912 states, 907 states have (on average 1.6218302094818082) internal successors, (1471), 907 states have internal predecessors, (1471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,491 INFO L74 IsIncluded]: Start isIncluded. First operand 929 states. Second operand has 912 states, 907 states have (on average 1.6218302094818082) internal successors, (1471), 907 states have internal predecessors, (1471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,491 INFO L87 Difference]: Start difference. First operand 929 states. Second operand has 912 states, 907 states have (on average 1.6218302094818082) internal successors, (1471), 907 states have internal predecessors, (1471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:19,514 INFO L93 Difference]: Finished difference Result 929 states and 1497 transitions. [2022-04-15 11:49:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1497 transitions. [2022-04-15 11:49:19,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:19,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:19,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 907 states have (on average 1.6218302094818082) internal successors, (1471), 907 states have internal predecessors, (1471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 929 states. [2022-04-15 11:49:19,517 INFO L87 Difference]: Start difference. First operand has 912 states, 907 states have (on average 1.6218302094818082) internal successors, (1471), 907 states have internal predecessors, (1471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 929 states. [2022-04-15 11:49:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:19,540 INFO L93 Difference]: Finished difference Result 929 states and 1497 transitions. [2022-04-15 11:49:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1497 transitions. [2022-04-15 11:49:19,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:19,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:19,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:19,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 907 states have (on average 1.6218302094818082) internal successors, (1471), 907 states have internal predecessors, (1471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1475 transitions. [2022-04-15 11:49:19,574 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1475 transitions. Word has length 119 [2022-04-15 11:49:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:19,574 INFO L478 AbstractCegarLoop]: Abstraction has 912 states and 1475 transitions. [2022-04-15 11:49:19,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1475 transitions. [2022-04-15 11:49:22,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1475 edges. 1474 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1475 transitions. [2022-04-15 11:49:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 11:49:22,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:22,904 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-15 11:49:22,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:49:22,904 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -158828971, now seen corresponding path program 1 times [2022-04-15 11:49:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:22,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266229769] [2022-04-15 11:49:22,992 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:22,992 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:22,992 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash -158828971, now seen corresponding path program 2 times [2022-04-15 11:49:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796995903] [2022-04-15 11:49:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:23,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {100554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {100547#true} is VALID [2022-04-15 11:49:23,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {100547#true} assume true; {100547#true} is VALID [2022-04-15 11:49:23,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100547#true} {100547#true} #710#return; {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {100547#true} call ULTIMATE.init(); {100554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:23,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {100554#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {100547#true} assume true; {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100547#true} {100547#true} #710#return; {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {100547#true} call #t~ret161 := main(); {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {100547#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; {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {100547#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L272 TraceCheckUtils]: 7: Hoare triple {100547#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {100547#true} is VALID [2022-04-15 11:49:23,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {100547#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); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {100547#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; {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {100547#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; {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {100547#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {100547#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {100547#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {100547#true} assume !false; {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {100547#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); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {100547#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {100547#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {100547#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {100547#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {100547#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {100547#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {100547#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {100547#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100547#true} is VALID [2022-04-15 11:49:23,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {100547#true} assume 8464 == #t~mem55;havoc #t~mem55; {100547#true} is VALID [2022-04-15 11:49:23,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {100547#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; {100547#true} is VALID [2022-04-15 11:49:23,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {100547#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100547#true} is VALID [2022-04-15 11:49:23,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {100547#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); {100552#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:23,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {100552#(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); {100552#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:23,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {100552#(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; {100552#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:23,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {100552#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {100552#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:23,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {100552#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {100552#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {100552#(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); {100553#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {100553#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {100548#false} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {100548#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {100548#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {100548#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100548#false} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {100548#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {100548#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {100548#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {100548#false} ~skip~0 := 0; {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {100548#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {100548#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {100548#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {100548#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {100548#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {100548#false} assume 8480 == #t~mem52;havoc #t~mem52; {100548#false} is VALID [2022-04-15 11:49:23,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {100548#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; {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {100548#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {100548#false} ~skip~0 := 0; {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {100548#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {100548#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {100548#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {100548#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {100548#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {100548#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 66: Hoare triple {100548#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {100548#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {100548#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {100548#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {100548#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 71: Hoare triple {100548#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 72: Hoare triple {100548#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {100548#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {100548#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {100548#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {100548#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {100548#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {100548#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {100548#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 80: Hoare triple {100548#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 81: Hoare triple {100548#false} assume 8448 == #t~mem68;havoc #t~mem68; {100548#false} is VALID [2022-04-15 11:49:23,168 INFO L290 TraceCheckUtils]: 82: Hoare triple {100548#false} assume !(~num1~0 > 0); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 83: Hoare triple {100548#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; {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {100548#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {100548#false} ~skip~0 := 0; {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {100548#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); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {100548#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {100548#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {100548#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {100548#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 93: Hoare triple {100548#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {100548#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {100548#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {100548#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {100548#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 98: Hoare triple {100548#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 99: Hoare triple {100548#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 100: Hoare triple {100548#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {100548#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 102: Hoare triple {100548#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 103: Hoare triple {100548#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 104: Hoare triple {100548#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 105: Hoare triple {100548#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 106: Hoare triple {100548#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 107: Hoare triple {100548#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 108: Hoare triple {100548#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 109: Hoare triple {100548#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 110: Hoare triple {100548#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,170 INFO L290 TraceCheckUtils]: 111: Hoare triple {100548#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 112: Hoare triple {100548#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 113: Hoare triple {100548#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 114: Hoare triple {100548#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 115: Hoare triple {100548#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 116: Hoare triple {100548#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 117: Hoare triple {100548#false} assume 8640 == #t~mem75;havoc #t~mem75; {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 118: Hoare triple {100548#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 119: Hoare triple {100548#false} assume !(9 == ~blastFlag~0); {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 120: Hoare triple {100548#false} assume 12 == ~blastFlag~0; {100548#false} is VALID [2022-04-15 11:49:23,171 INFO L290 TraceCheckUtils]: 121: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-15 11:49:23,171 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-15 11:49:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:23,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796995903] [2022-04-15 11:49:23,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796995903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:23,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:23,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:23,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:23,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266229769] [2022-04-15 11:49:23,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266229769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:23,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:23,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478829041] [2022-04-15 11:49:23,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:23,173 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-15 11:49:23,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:23,174 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-15 11:49:23,231 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-15 11:49:23,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:23,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:23,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:23,232 INFO L87 Difference]: Start difference. First operand 912 states and 1475 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-15 11:49:25,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:27,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:35,949 INFO L93 Difference]: Finished difference Result 1770 states and 2801 transitions. [2022-04-15 11:49:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:35,949 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-15 11:49:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:35,950 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-15 11:49:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-15 11:49:35,952 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-15 11:49:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-15 11:49:35,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 611 transitions. [2022-04-15 11:49:36,356 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-15 11:49:36,401 INFO L225 Difference]: With dead ends: 1770 [2022-04-15 11:49:36,401 INFO L226 Difference]: Without dead ends: 1146 [2022-04-15 11:49:36,402 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:36,402 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 156 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:36,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 376 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 11:49:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-04-15 11:49:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 912. [2022-04-15 11:49:36,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:36,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1146 states. Second operand has 912 states, 907 states have (on average 1.60529217199559) internal successors, (1456), 907 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:36,438 INFO L74 IsIncluded]: Start isIncluded. First operand 1146 states. Second operand has 912 states, 907 states have (on average 1.60529217199559) internal successors, (1456), 907 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:36,439 INFO L87 Difference]: Start difference. First operand 1146 states. Second operand has 912 states, 907 states have (on average 1.60529217199559) internal successors, (1456), 907 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:36,471 INFO L93 Difference]: Finished difference Result 1146 states and 1777 transitions. [2022-04-15 11:49:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1777 transitions. [2022-04-15 11:49:36,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:36,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:36,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 907 states have (on average 1.60529217199559) internal successors, (1456), 907 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1146 states. [2022-04-15 11:49:36,474 INFO L87 Difference]: Start difference. First operand has 912 states, 907 states have (on average 1.60529217199559) internal successors, (1456), 907 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1146 states. [2022-04-15 11:49:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:36,506 INFO L93 Difference]: Finished difference Result 1146 states and 1777 transitions. [2022-04-15 11:49:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1777 transitions. [2022-04-15 11:49:36,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:36,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:36,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:36,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 907 states have (on average 1.60529217199559) internal successors, (1456), 907 states have internal predecessors, (1456), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1460 transitions. [2022-04-15 11:49:36,541 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1460 transitions. Word has length 122 [2022-04-15 11:49:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:36,541 INFO L478 AbstractCegarLoop]: Abstraction has 912 states and 1460 transitions. [2022-04-15 11:49:36,541 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-15 11:49:36,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1460 transitions. [2022-04-15 11:49:39,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1460 edges. 1459 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1460 transitions. [2022-04-15 11:49:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 11:49:39,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:39,894 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-15 11:49:39,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:49:39,894 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1699899791, now seen corresponding path program 1 times [2022-04-15 11:49:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:39,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [861012981] [2022-04-15 11:49:39,964 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:39,964 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:39,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:39,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1699899791, now seen corresponding path program 2 times [2022-04-15 11:49:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:39,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586043767] [2022-04-15 11:49:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:39,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:40,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {108222#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {108215#true} is VALID [2022-04-15 11:49:40,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {108215#true} assume true; {108215#true} is VALID [2022-04-15 11:49:40,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108215#true} {108215#true} #710#return; {108215#true} is VALID [2022-04-15 11:49:40,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {108215#true} call ULTIMATE.init(); {108222#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:40,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {108222#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {108215#true} is VALID [2022-04-15 11:49:40,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {108215#true} assume true; {108215#true} is VALID [2022-04-15 11:49:40,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108215#true} {108215#true} #710#return; {108215#true} is VALID [2022-04-15 11:49:40,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {108215#true} call #t~ret161 := main(); {108215#true} is VALID [2022-04-15 11:49:40,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {108215#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; {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {108215#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L272 TraceCheckUtils]: 7: Hoare triple {108215#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {108215#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); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {108215#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; {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {108215#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; {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {108215#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {108215#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {108215#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {108215#true} assume !false; {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {108215#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); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {108215#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {108215#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {108215#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {108215#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {108215#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {108215#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {108215#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {108215#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {108215#true} assume 8464 == #t~mem55;havoc #t~mem55; {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {108215#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; {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {108215#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {108215#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); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {108215#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); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {108215#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {108215#true} ~skip~0 := 0; {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {108215#true} assume !false; {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {108215#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); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {108215#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {108215#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {108215#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {108215#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {108215#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {108215#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {108215#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {108215#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {108215#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {108215#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {108215#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {108215#true} assume 8496 == #t~mem58;havoc #t~mem58; {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {108215#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {108215#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {108215#true} is VALID [2022-04-15 11:49:40,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {108215#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {108215#true} is VALID [2022-04-15 11:49:40,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {108215#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,143 INFO L290 TraceCheckUtils]: 51: Hoare triple {108220#(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; {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,148 INFO L290 TraceCheckUtils]: 65: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,151 INFO L290 TraceCheckUtils]: 74: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,152 INFO L290 TraceCheckUtils]: 76: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,152 INFO L290 TraceCheckUtils]: 77: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,152 INFO L290 TraceCheckUtils]: 78: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {108220#(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); {108220#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:40,153 INFO L290 TraceCheckUtils]: 80: Hoare triple {108220#(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); {108221#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-15 11:49:40,153 INFO L290 TraceCheckUtils]: 81: Hoare triple {108221#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {108216#false} is VALID [2022-04-15 11:49:40,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {108216#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {108216#false} is VALID [2022-04-15 11:49:40,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {108216#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {108216#false} is VALID [2022-04-15 11:49:40,153 INFO L290 TraceCheckUtils]: 84: Hoare triple {108216#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); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 85: Hoare triple {108216#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); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 86: Hoare triple {108216#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 87: Hoare triple {108216#false} ~skip~0 := 0; {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 88: Hoare triple {108216#false} assume !false; {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 89: Hoare triple {108216#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); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 90: Hoare triple {108216#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 91: Hoare triple {108216#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 92: Hoare triple {108216#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 93: Hoare triple {108216#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 94: Hoare triple {108216#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 95: Hoare triple {108216#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 96: Hoare triple {108216#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 97: Hoare triple {108216#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 98: Hoare triple {108216#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,154 INFO L290 TraceCheckUtils]: 99: Hoare triple {108216#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 100: Hoare triple {108216#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 101: Hoare triple {108216#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 102: Hoare triple {108216#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 103: Hoare triple {108216#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 104: Hoare triple {108216#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 105: Hoare triple {108216#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 106: Hoare triple {108216#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 107: Hoare triple {108216#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 108: Hoare triple {108216#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 109: Hoare triple {108216#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 110: Hoare triple {108216#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 111: Hoare triple {108216#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 112: Hoare triple {108216#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,155 INFO L290 TraceCheckUtils]: 113: Hoare triple {108216#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 114: Hoare triple {108216#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 115: Hoare triple {108216#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 116: Hoare triple {108216#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 117: Hoare triple {108216#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 118: Hoare triple {108216#false} assume 8640 == #t~mem75;havoc #t~mem75; {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 119: Hoare triple {108216#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 120: Hoare triple {108216#false} assume !(9 == ~blastFlag~0); {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 121: Hoare triple {108216#false} assume 12 == ~blastFlag~0; {108216#false} is VALID [2022-04-15 11:49:40,156 INFO L290 TraceCheckUtils]: 122: Hoare triple {108216#false} assume !false; {108216#false} is VALID [2022-04-15 11:49:40,156 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-15 11:49:40,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586043767] [2022-04-15 11:49:40,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586043767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:40,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:40,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:40,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [861012981] [2022-04-15 11:49:40,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [861012981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:40,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:40,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777523313] [2022-04-15 11:49:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:40,158 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-15 11:49:40,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:40,158 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-15 11:49:40,235 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-15 11:49:40,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:40,236 INFO L87 Difference]: Start difference. First operand 912 states and 1460 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-15 11:49:44,231 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-15 11:49:46,732 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-15 11:49:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:54,009 INFO L93 Difference]: Finished difference Result 2152 states and 3410 transitions. [2022-04-15 11:49:54,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:54,010 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-15 11:49:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:54,010 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-15 11:49:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:49:54,012 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-15 11:49:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:49:54,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-15 11:49:54,402 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-15 11:49:54,466 INFO L225 Difference]: With dead ends: 2152 [2022-04-15 11:49:54,466 INFO L226 Difference]: Without dead ends: 1266 [2022-04-15 11:49:54,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:54,468 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 129 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:54,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 376 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 11:49:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-04-15 11:49:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1023. [2022-04-15 11:49:54,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:54,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1266 states. Second operand has 1023 states, 1018 states have (on average 1.6159135559921414) internal successors, (1645), 1018 states have internal predecessors, (1645), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,520 INFO L74 IsIncluded]: Start isIncluded. First operand 1266 states. Second operand has 1023 states, 1018 states have (on average 1.6159135559921414) internal successors, (1645), 1018 states have internal predecessors, (1645), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,521 INFO L87 Difference]: Start difference. First operand 1266 states. Second operand has 1023 states, 1018 states have (on average 1.6159135559921414) internal successors, (1645), 1018 states have internal predecessors, (1645), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:54,559 INFO L93 Difference]: Finished difference Result 1266 states and 1978 transitions. [2022-04-15 11:49:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1978 transitions. [2022-04-15 11:49:54,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:54,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:54,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1018 states have (on average 1.6159135559921414) internal successors, (1645), 1018 states have internal predecessors, (1645), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1266 states. [2022-04-15 11:49:54,562 INFO L87 Difference]: Start difference. First operand has 1023 states, 1018 states have (on average 1.6159135559921414) internal successors, (1645), 1018 states have internal predecessors, (1645), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1266 states. [2022-04-15 11:49:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:54,601 INFO L93 Difference]: Finished difference Result 1266 states and 1978 transitions. [2022-04-15 11:49:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1978 transitions. [2022-04-15 11:49:54,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:54,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:54,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:54,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.6159135559921414) internal successors, (1645), 1018 states have internal predecessors, (1645), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1649 transitions. [2022-04-15 11:49:54,643 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1649 transitions. Word has length 123 [2022-04-15 11:49:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:54,643 INFO L478 AbstractCegarLoop]: Abstraction has 1023 states and 1649 transitions. [2022-04-15 11:49:54,643 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-15 11:49:54,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1649 transitions. [2022-04-15 11:49:58,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1649 edges. 1648 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1649 transitions. [2022-04-15 11:49:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 11:49:58,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:58,221 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-15 11:49:58,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:49:58,221 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash 287066353, now seen corresponding path program 1 times [2022-04-15 11:49:58,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:58,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764376359] [2022-04-15 11:49:58,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:58,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:58,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash 287066353, now seen corresponding path program 2 times [2022-04-15 11:49:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704918172] [2022-04-15 11:49:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:58,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {117116#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {117109#true} is VALID [2022-04-15 11:49:58,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {117109#true} assume true; {117109#true} is VALID [2022-04-15 11:49:58,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117109#true} {117109#true} #710#return; {117109#true} is VALID [2022-04-15 11:49:58,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {117109#true} call ULTIMATE.init(); {117116#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:58,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {117116#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {117109#true} is VALID [2022-04-15 11:49:58,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {117109#true} assume true; {117109#true} is VALID [2022-04-15 11:49:58,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117109#true} {117109#true} #710#return; {117109#true} is VALID [2022-04-15 11:49:58,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {117109#true} call #t~ret161 := main(); {117109#true} is VALID [2022-04-15 11:49:58,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {117109#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; {117109#true} is VALID [2022-04-15 11:49:58,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {117109#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L272 TraceCheckUtils]: 7: Hoare triple {117109#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {117109#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); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {117109#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; {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {117109#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; {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {117109#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {117109#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {117109#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {117109#true} assume !false; {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {117109#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); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {117109#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {117109#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {117109#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {117109#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {117109#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {117109#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {117109#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {117109#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {117109#true} assume 8464 == #t~mem55;havoc #t~mem55; {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {117109#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; {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {117109#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {117109#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); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {117109#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); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {117109#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {117109#true} ~skip~0 := 0; {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {117109#true} assume !false; {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {117109#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); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {117109#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {117109#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {117109#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {117109#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {117109#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {117109#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {117109#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {117109#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {117109#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {117109#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {117109#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {117109#true} assume 8496 == #t~mem58;havoc #t~mem58; {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {117109#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {117109#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {117109#true} is VALID [2022-04-15 11:49:58,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {117109#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {117109#true} is VALID [2022-04-15 11:49:58,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {117109#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {117114#(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; {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,455 INFO L290 TraceCheckUtils]: 55: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,456 INFO L290 TraceCheckUtils]: 59: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,458 INFO L290 TraceCheckUtils]: 63: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,459 INFO L290 TraceCheckUtils]: 67: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,460 INFO L290 TraceCheckUtils]: 71: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,462 INFO L290 TraceCheckUtils]: 75: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,462 INFO L290 TraceCheckUtils]: 76: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,462 INFO L290 TraceCheckUtils]: 77: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,463 INFO L290 TraceCheckUtils]: 79: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,463 INFO L290 TraceCheckUtils]: 80: Hoare triple {117114#(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); {117114#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:58,464 INFO L290 TraceCheckUtils]: 81: Hoare triple {117114#(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); {117115#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-15 11:49:58,464 INFO L290 TraceCheckUtils]: 82: Hoare triple {117115#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {117110#false} is VALID [2022-04-15 11:49:58,464 INFO L290 TraceCheckUtils]: 83: Hoare triple {117110#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {117110#false} is VALID [2022-04-15 11:49:58,464 INFO L290 TraceCheckUtils]: 84: Hoare triple {117110#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {117110#false} is VALID [2022-04-15 11:49:58,464 INFO L290 TraceCheckUtils]: 85: Hoare triple {117110#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); {117110#false} is VALID [2022-04-15 11:49:58,464 INFO L290 TraceCheckUtils]: 86: Hoare triple {117110#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); {117110#false} is VALID [2022-04-15 11:49:58,464 INFO L290 TraceCheckUtils]: 87: Hoare triple {117110#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 88: Hoare triple {117110#false} ~skip~0 := 0; {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 89: Hoare triple {117110#false} assume !false; {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 90: Hoare triple {117110#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); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 91: Hoare triple {117110#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 92: Hoare triple {117110#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 93: Hoare triple {117110#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 94: Hoare triple {117110#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 95: Hoare triple {117110#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 96: Hoare triple {117110#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 97: Hoare triple {117110#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 98: Hoare triple {117110#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 99: Hoare triple {117110#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {117110#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 101: Hoare triple {117110#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,465 INFO L290 TraceCheckUtils]: 102: Hoare triple {117110#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 103: Hoare triple {117110#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 104: Hoare triple {117110#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {117110#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 106: Hoare triple {117110#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 107: Hoare triple {117110#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 108: Hoare triple {117110#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 109: Hoare triple {117110#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 110: Hoare triple {117110#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 111: Hoare triple {117110#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 112: Hoare triple {117110#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 113: Hoare triple {117110#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 114: Hoare triple {117110#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 115: Hoare triple {117110#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,466 INFO L290 TraceCheckUtils]: 116: Hoare triple {117110#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,467 INFO L290 TraceCheckUtils]: 117: Hoare triple {117110#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,467 INFO L290 TraceCheckUtils]: 118: Hoare triple {117110#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {117110#false} is VALID [2022-04-15 11:49:58,467 INFO L290 TraceCheckUtils]: 119: Hoare triple {117110#false} assume 8640 == #t~mem75;havoc #t~mem75; {117110#false} is VALID [2022-04-15 11:49:58,467 INFO L290 TraceCheckUtils]: 120: Hoare triple {117110#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {117110#false} is VALID [2022-04-15 11:49:58,467 INFO L290 TraceCheckUtils]: 121: Hoare triple {117110#false} assume !(9 == ~blastFlag~0); {117110#false} is VALID [2022-04-15 11:49:58,467 INFO L290 TraceCheckUtils]: 122: Hoare triple {117110#false} assume 12 == ~blastFlag~0; {117110#false} is VALID [2022-04-15 11:49:58,467 INFO L290 TraceCheckUtils]: 123: Hoare triple {117110#false} assume !false; {117110#false} is VALID [2022-04-15 11:49:58,468 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-15 11:49:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704918172] [2022-04-15 11:49:58,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704918172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:58,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:58,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:58,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764376359] [2022-04-15 11:49:58,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764376359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:58,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:58,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616011964] [2022-04-15 11:49:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:58,469 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-15 11:49:58,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:58,469 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-15 11:49:58,541 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-15 11:49:58,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:58,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:58,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:58,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:58,543 INFO L87 Difference]: Start difference. First operand 1023 states and 1649 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-15 11:50:03,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:11,530 INFO L93 Difference]: Finished difference Result 2254 states and 3581 transitions. [2022-04-15 11:50:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:11,530 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-15 11:50:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:11,531 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-15 11:50:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:50:11,533 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-15 11:50:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-15 11:50:11,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-15 11:50:11,947 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-15 11:50:12,002 INFO L225 Difference]: With dead ends: 2254 [2022-04-15 11:50:12,002 INFO L226 Difference]: Without dead ends: 1257 [2022-04-15 11:50:12,003 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:12,004 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 128 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:12,004 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 390 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 494 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:50:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-04-15 11:50:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1023. [2022-04-15 11:50:12,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:12,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1257 states. Second operand has 1023 states, 1018 states have (on average 1.6100196463654224) internal successors, (1639), 1018 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,051 INFO L74 IsIncluded]: Start isIncluded. First operand 1257 states. Second operand has 1023 states, 1018 states have (on average 1.6100196463654224) internal successors, (1639), 1018 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,052 INFO L87 Difference]: Start difference. First operand 1257 states. Second operand has 1023 states, 1018 states have (on average 1.6100196463654224) internal successors, (1639), 1018 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:12,090 INFO L93 Difference]: Finished difference Result 1257 states and 1960 transitions. [2022-04-15 11:50:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1960 transitions. [2022-04-15 11:50:12,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:12,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:12,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1018 states have (on average 1.6100196463654224) internal successors, (1639), 1018 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1257 states. [2022-04-15 11:50:12,092 INFO L87 Difference]: Start difference. First operand has 1023 states, 1018 states have (on average 1.6100196463654224) internal successors, (1639), 1018 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1257 states. [2022-04-15 11:50:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:12,131 INFO L93 Difference]: Finished difference Result 1257 states and 1960 transitions. [2022-04-15 11:50:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1960 transitions. [2022-04-15 11:50:12,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:12,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:12,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:12,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.6100196463654224) internal successors, (1639), 1018 states have internal predecessors, (1639), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1643 transitions. [2022-04-15 11:50:12,181 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1643 transitions. Word has length 124 [2022-04-15 11:50:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:12,181 INFO L478 AbstractCegarLoop]: Abstraction has 1023 states and 1643 transitions. [2022-04-15 11:50:12,181 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-15 11:50:12,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1643 transitions. [2022-04-15 11:50:15,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1643 edges. 1642 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1643 transitions. [2022-04-15 11:50:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 11:50:15,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:15,864 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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-15 11:50:15,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:50:15,865 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:15,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1572502022, now seen corresponding path program 1 times [2022-04-15 11:50:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:15,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244519224] [2022-04-15 11:50:15,926 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:15,926 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:15,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1572502022, now seen corresponding path program 2 times [2022-04-15 11:50:15,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:15,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469122730] [2022-04-15 11:50:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:16,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {126196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {126189#true} is VALID [2022-04-15 11:50:16,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {126189#true} assume true; {126189#true} is VALID [2022-04-15 11:50:16,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126189#true} {126189#true} #710#return; {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {126189#true} call ULTIMATE.init(); {126196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:50:16,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {126196#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {126189#true} assume true; {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126189#true} {126189#true} #710#return; {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {126189#true} call #t~ret161 := main(); {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {126189#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; {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {126189#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L272 TraceCheckUtils]: 7: Hoare triple {126189#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {126189#true} is VALID [2022-04-15 11:50:16,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {126189#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); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {126189#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; {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {126189#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; {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {126189#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {126189#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {126189#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {126189#true} assume !false; {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {126189#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); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {126189#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {126189#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {126189#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {126189#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {126189#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {126189#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {126189#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {126189#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {126189#true} assume 8464 == #t~mem55;havoc #t~mem55; {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {126189#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; {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {126189#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {126189#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); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {126189#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); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {126189#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {126189#true} ~skip~0 := 0; {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {126189#true} assume !false; {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {126189#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); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {126189#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {126189#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {126189#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {126189#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {126189#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {126189#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {126189#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {126189#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {126189#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {126189#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {126189#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {126189#true} assume 8496 == #t~mem58;havoc #t~mem58; {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {126189#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {126189#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {126189#true} is VALID [2022-04-15 11:50:16,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {126189#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {126189#true} is VALID [2022-04-15 11:50:16,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {126189#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {126194#(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); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {126194#(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; {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {126194#(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); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {126194#(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); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {126194#(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); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {126194#(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); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {126194#(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); {126194#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:16,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {126194#(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); {126195#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:50:16,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {126195#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {126190#false} is VALID [2022-04-15 11:50:16,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {126190#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; {126190#false} is VALID [2022-04-15 11:50:16,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {126190#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); {126190#false} is VALID [2022-04-15 11:50:16,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {126190#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); {126190#false} is VALID [2022-04-15 11:50:16,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {126190#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 65: Hoare triple {126190#false} ~skip~0 := 0; {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {126190#false} assume !false; {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {126190#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); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {126190#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 69: Hoare triple {126190#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 70: Hoare triple {126190#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 71: Hoare triple {126190#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {126190#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {126190#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {126190#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {126190#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {126190#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {126190#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 78: Hoare triple {126190#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {126190#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {126190#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 81: Hoare triple {126190#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {126190#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {126190#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {126190#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {126190#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {126190#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 87: Hoare triple {126190#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {126190#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {126190#false} assume 8448 == #t~mem68;havoc #t~mem68; {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {126190#false} assume !(~num1~0 > 0); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 91: Hoare triple {126190#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; {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 92: Hoare triple {126190#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); {126190#false} is VALID [2022-04-15 11:50:16,104 INFO L290 TraceCheckUtils]: 93: Hoare triple {126190#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {126190#false} ~skip~0 := 0; {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 95: Hoare triple {126190#false} assume !false; {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 96: Hoare triple {126190#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); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {126190#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 98: Hoare triple {126190#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 99: Hoare triple {126190#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 100: Hoare triple {126190#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 101: Hoare triple {126190#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 102: Hoare triple {126190#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 103: Hoare triple {126190#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 104: Hoare triple {126190#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 105: Hoare triple {126190#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 106: Hoare triple {126190#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 107: Hoare triple {126190#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,105 INFO L290 TraceCheckUtils]: 108: Hoare triple {126190#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 109: Hoare triple {126190#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 110: Hoare triple {126190#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 111: Hoare triple {126190#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 112: Hoare triple {126190#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 113: Hoare triple {126190#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 114: Hoare triple {126190#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 115: Hoare triple {126190#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 116: Hoare triple {126190#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 117: Hoare triple {126190#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 118: Hoare triple {126190#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 119: Hoare triple {126190#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 120: Hoare triple {126190#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 121: Hoare triple {126190#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 122: Hoare triple {126190#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,106 INFO L290 TraceCheckUtils]: 123: Hoare triple {126190#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,107 INFO L290 TraceCheckUtils]: 124: Hoare triple {126190#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {126190#false} is VALID [2022-04-15 11:50:16,107 INFO L290 TraceCheckUtils]: 125: Hoare triple {126190#false} assume 8640 == #t~mem75;havoc #t~mem75; {126190#false} is VALID [2022-04-15 11:50:16,107 INFO L290 TraceCheckUtils]: 126: Hoare triple {126190#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {126190#false} is VALID [2022-04-15 11:50:16,107 INFO L290 TraceCheckUtils]: 127: Hoare triple {126190#false} assume !(9 == ~blastFlag~0); {126190#false} is VALID [2022-04-15 11:50:16,107 INFO L290 TraceCheckUtils]: 128: Hoare triple {126190#false} assume 12 == ~blastFlag~0; {126190#false} is VALID [2022-04-15 11:50:16,107 INFO L290 TraceCheckUtils]: 129: Hoare triple {126190#false} assume !false; {126190#false} is VALID [2022-04-15 11:50:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:50:16,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:16,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469122730] [2022-04-15 11:50:16,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469122730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:16,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:16,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:16,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:16,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244519224] [2022-04-15 11:50:16,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244519224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:16,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:16,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:16,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097163121] [2022-04-15 11:50:16,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:16,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 11:50:16,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:16,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:16,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:16,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:16,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:16,167 INFO L87 Difference]: Start difference. First operand 1023 states and 1643 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:18,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:20,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:24,826 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-15 11:50:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:28,573 INFO L93 Difference]: Finished difference Result 2254 states and 3569 transitions. [2022-04-15 11:50:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:28,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-15 11:50:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:50:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:50:28,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-15 11:50:28,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:29,017 INFO L225 Difference]: With dead ends: 2254 [2022-04-15 11:50:29,017 INFO L226 Difference]: Without dead ends: 1257 [2022-04-15 11:50:29,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:29,018 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 149 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:29,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 390 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:50:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-04-15 11:50:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1023. [2022-04-15 11:50:29,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:29,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1257 states. Second operand has 1023 states, 1018 states have (on average 1.5952848722986248) internal successors, (1624), 1018 states have internal predecessors, (1624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:29,067 INFO L74 IsIncluded]: Start isIncluded. First operand 1257 states. Second operand has 1023 states, 1018 states have (on average 1.5952848722986248) internal successors, (1624), 1018 states have internal predecessors, (1624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:29,068 INFO L87 Difference]: Start difference. First operand 1257 states. Second operand has 1023 states, 1018 states have (on average 1.5952848722986248) internal successors, (1624), 1018 states have internal predecessors, (1624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:29,105 INFO L93 Difference]: Finished difference Result 1257 states and 1945 transitions. [2022-04-15 11:50:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1945 transitions. [2022-04-15 11:50:29,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:29,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:29,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 1018 states have (on average 1.5952848722986248) internal successors, (1624), 1018 states have internal predecessors, (1624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1257 states. [2022-04-15 11:50:29,107 INFO L87 Difference]: Start difference. First operand has 1023 states, 1018 states have (on average 1.5952848722986248) internal successors, (1624), 1018 states have internal predecessors, (1624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1257 states. [2022-04-15 11:50:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:29,145 INFO L93 Difference]: Finished difference Result 1257 states and 1945 transitions. [2022-04-15 11:50:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1945 transitions. [2022-04-15 11:50:29,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:29,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:29,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:29,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1018 states have (on average 1.5952848722986248) internal successors, (1624), 1018 states have internal predecessors, (1624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1628 transitions. [2022-04-15 11:50:29,196 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1628 transitions. Word has length 130 [2022-04-15 11:50:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:29,196 INFO L478 AbstractCegarLoop]: Abstraction has 1023 states and 1628 transitions. [2022-04-15 11:50:29,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:29,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1628 transitions. [2022-04-15 11:50:32,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1628 edges. 1627 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1628 transitions. [2022-04-15 11:50:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 11:50:32,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:32,785 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-15 11:50:32,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:50:32,785 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -688048203, now seen corresponding path program 1 times [2022-04-15 11:50:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707592188] [2022-04-15 11:50:32,859 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:32,859 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:32,859 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -688048203, now seen corresponding path program 2 times [2022-04-15 11:50:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:32,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881372995] [2022-04-15 11:50:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:33,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:33,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {135276#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {135269#true} is VALID [2022-04-15 11:50:33,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {135269#true} assume true; {135269#true} is VALID [2022-04-15 11:50:33,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135269#true} {135269#true} #710#return; {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {135269#true} call ULTIMATE.init(); {135276#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {135276#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {135269#true} assume true; {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135269#true} {135269#true} #710#return; {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {135269#true} call #t~ret161 := main(); {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {135269#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; {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {135269#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L272 TraceCheckUtils]: 7: Hoare triple {135269#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {135269#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); {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {135269#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; {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {135269#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; {135269#true} is VALID [2022-04-15 11:50:33,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {135269#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {135269#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {135269#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {135269#true} assume !false; {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {135269#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); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {135269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {135269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {135269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {135269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {135269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {135269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {135269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {135269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {135269#true} assume 8464 == #t~mem55;havoc #t~mem55; {135269#true} is VALID [2022-04-15 11:50:33,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {135269#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; {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {135269#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {135269#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); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {135269#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); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {135269#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {135269#true} ~skip~0 := 0; {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {135269#true} assume !false; {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {135269#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); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {135269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {135269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {135269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {135269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {135269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {135269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {135269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {135269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {135269#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {135269#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {135269#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {135269#true} assume 8496 == #t~mem58;havoc #t~mem58; {135269#true} is VALID [2022-04-15 11:50:33,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {135269#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {135269#true} is VALID [2022-04-15 11:50:33,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {135269#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {135269#true} is VALID [2022-04-15 11:50:33,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {135269#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {135269#true} is VALID [2022-04-15 11:50:33,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {135269#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {135274#(= 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); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {135274#(= 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; {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {135274#(= 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); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {135274#(= 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); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {135274#(= 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); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {135274#(= 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); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {135274#(= 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); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,027 INFO L290 TraceCheckUtils]: 59: Hoare triple {135274#(= 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); {135274#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:33,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {135274#(= 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); {135275#(= |ssl3_accept_#t~mem53| 8656)} is VALID [2022-04-15 11:50:33,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {135275#(= |ssl3_accept_#t~mem53| 8656)} assume 8481 == #t~mem53;havoc #t~mem53; {135270#false} is VALID [2022-04-15 11:50:33,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {135270#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; {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {135270#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); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {135270#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); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {135270#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {135270#false} ~skip~0 := 0; {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 67: Hoare triple {135270#false} assume !false; {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 68: Hoare triple {135270#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); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 69: Hoare triple {135270#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {135270#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {135270#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 72: Hoare triple {135270#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {135270#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 74: Hoare triple {135270#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {135270#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 76: Hoare triple {135270#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {135270#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {135270#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 79: Hoare triple {135270#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 80: Hoare triple {135270#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 81: Hoare triple {135270#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 82: Hoare triple {135270#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {135270#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {135270#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 85: Hoare triple {135270#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 86: Hoare triple {135270#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 87: Hoare triple {135270#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {135270#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 89: Hoare triple {135270#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 90: Hoare triple {135270#false} assume 8448 == #t~mem68;havoc #t~mem68; {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 91: Hoare triple {135270#false} assume !(~num1~0 > 0); {135270#false} is VALID [2022-04-15 11:50:33,029 INFO L290 TraceCheckUtils]: 92: Hoare triple {135270#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; {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 93: Hoare triple {135270#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); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 94: Hoare triple {135270#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 95: Hoare triple {135270#false} ~skip~0 := 0; {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 96: Hoare triple {135270#false} assume !false; {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 97: Hoare triple {135270#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); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 98: Hoare triple {135270#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 99: Hoare triple {135270#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 100: Hoare triple {135270#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 101: Hoare triple {135270#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 102: Hoare triple {135270#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 103: Hoare triple {135270#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 104: Hoare triple {135270#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 105: Hoare triple {135270#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,030 INFO L290 TraceCheckUtils]: 106: Hoare triple {135270#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 107: Hoare triple {135270#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 108: Hoare triple {135270#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 109: Hoare triple {135270#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 110: Hoare triple {135270#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 111: Hoare triple {135270#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 112: Hoare triple {135270#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 113: Hoare triple {135270#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 114: Hoare triple {135270#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 115: Hoare triple {135270#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 116: Hoare triple {135270#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 117: Hoare triple {135270#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 118: Hoare triple {135270#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 119: Hoare triple {135270#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,031 INFO L290 TraceCheckUtils]: 120: Hoare triple {135270#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 121: Hoare triple {135270#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 122: Hoare triple {135270#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 123: Hoare triple {135270#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 124: Hoare triple {135270#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 125: Hoare triple {135270#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 126: Hoare triple {135270#false} assume 8640 == #t~mem75;havoc #t~mem75; {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 127: Hoare triple {135270#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 128: Hoare triple {135270#false} assume !(9 == ~blastFlag~0); {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 129: Hoare triple {135270#false} assume 12 == ~blastFlag~0; {135270#false} is VALID [2022-04-15 11:50:33,032 INFO L290 TraceCheckUtils]: 130: Hoare triple {135270#false} assume !false; {135270#false} is VALID [2022-04-15 11:50:33,032 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-15 11:50:33,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881372995] [2022-04-15 11:50:33,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881372995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:33,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:33,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:33,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707592188] [2022-04-15 11:50:33,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707592188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:33,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:33,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732013854] [2022-04-15 11:50:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:33,034 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-15 11:50:33,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:33,034 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-15 11:50:33,093 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-15 11:50:33,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:33,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:33,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:33,094 INFO L87 Difference]: Start difference. First operand 1023 states and 1628 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-15 11:50:35,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:40,127 INFO L93 Difference]: Finished difference Result 2297 states and 3629 transitions. [2022-04-15 11:50:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:40,128 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-15 11:50:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:40,128 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-15 11:50:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-15 11:50:40,130 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-15 11:50:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-15 11:50:40,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-15 11:50:40,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:40,535 INFO L225 Difference]: With dead ends: 2297 [2022-04-15 11:50:40,535 INFO L226 Difference]: Without dead ends: 1300 [2022-04-15 11:50:40,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:40,537 INFO L913 BasicCegarLoop]: 280 mSDtfsCounter, 103 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:40,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 679 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 618 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 11:50:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-04-15 11:50:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1080. [2022-04-15 11:50:40,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:40,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1300 states. Second operand has 1080 states, 1075 states have (on average 1.5832558139534885) internal successors, (1702), 1075 states have internal predecessors, (1702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:40,590 INFO L74 IsIncluded]: Start isIncluded. First operand 1300 states. Second operand has 1080 states, 1075 states have (on average 1.5832558139534885) internal successors, (1702), 1075 states have internal predecessors, (1702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:40,591 INFO L87 Difference]: Start difference. First operand 1300 states. Second operand has 1080 states, 1075 states have (on average 1.5832558139534885) internal successors, (1702), 1075 states have internal predecessors, (1702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:40,631 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2022-04-15 11:50:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2032 transitions. [2022-04-15 11:50:40,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:40,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:40,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 1080 states, 1075 states have (on average 1.5832558139534885) internal successors, (1702), 1075 states have internal predecessors, (1702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1300 states. [2022-04-15 11:50:40,633 INFO L87 Difference]: Start difference. First operand has 1080 states, 1075 states have (on average 1.5832558139534885) internal successors, (1702), 1075 states have internal predecessors, (1702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1300 states. [2022-04-15 11:50:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:40,673 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2022-04-15 11:50:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2032 transitions. [2022-04-15 11:50:40,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:40,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:40,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:40,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1075 states have (on average 1.5832558139534885) internal successors, (1702), 1075 states have internal predecessors, (1702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1706 transitions. [2022-04-15 11:50:40,728 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1706 transitions. Word has length 131 [2022-04-15 11:50:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:40,729 INFO L478 AbstractCegarLoop]: Abstraction has 1080 states and 1706 transitions. [2022-04-15 11:50:40,729 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-15 11:50:40,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1706 transitions. [2022-04-15 11:50:44,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1706 edges. 1705 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1706 transitions. [2022-04-15 11:50:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 11:50:44,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:44,504 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-15 11:50:44,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:50:44,505 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash 777583331, now seen corresponding path program 1 times [2022-04-15 11:50:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:44,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [301081223] [2022-04-15 11:50:44,584 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:44,584 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:44,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 777583331, now seen corresponding path program 2 times [2022-04-15 11:50:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:44,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621479223] [2022-04-15 11:50:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:44,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {144642#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {144635#true} is VALID [2022-04-15 11:50:44,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {144635#true} assume true; {144635#true} is VALID [2022-04-15 11:50:44,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144635#true} {144635#true} #710#return; {144635#true} is VALID [2022-04-15 11:50:44,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {144635#true} call ULTIMATE.init(); {144642#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:50:44,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {144642#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {144635#true} is VALID [2022-04-15 11:50:44,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {144635#true} assume true; {144635#true} is VALID [2022-04-15 11:50:44,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144635#true} {144635#true} #710#return; {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {144635#true} call #t~ret161 := main(); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {144635#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; {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {144635#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L272 TraceCheckUtils]: 7: Hoare triple {144635#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {144635#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); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {144635#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; {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {144635#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; {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {144635#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {144635#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {144635#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {144635#true} assume !false; {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {144635#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); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {144635#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {144635#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {144635#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {144635#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {144635#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {144635#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {144635#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {144635#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {144635#true} assume 8464 == #t~mem55;havoc #t~mem55; {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {144635#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; {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {144635#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {144635#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); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {144635#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); {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {144635#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {144635#true} ~skip~0 := 0; {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {144635#true} assume !false; {144635#true} is VALID [2022-04-15 11:50:44,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {144635#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); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {144635#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {144635#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {144635#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {144635#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {144635#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {144635#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {144635#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {144635#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {144635#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {144635#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {144635#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {144635#true} assume 8496 == #t~mem58;havoc #t~mem58; {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {144635#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {144635#true} is VALID [2022-04-15 11:50:44,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {144635#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {144635#true} is VALID [2022-04-15 11:50:44,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {144635#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {144635#true} is VALID [2022-04-15 11:50:44,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {144635#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,746 INFO L290 TraceCheckUtils]: 49: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {144640#(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; {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,755 INFO L290 TraceCheckUtils]: 74: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,755 INFO L290 TraceCheckUtils]: 75: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,758 INFO L290 TraceCheckUtils]: 83: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,758 INFO L290 TraceCheckUtils]: 84: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {144640#(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); {144640#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:44,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {144640#(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); {144641#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-15 11:50:44,759 INFO L290 TraceCheckUtils]: 87: Hoare triple {144641#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {144636#false} is VALID [2022-04-15 11:50:44,759 INFO L290 TraceCheckUtils]: 88: Hoare triple {144636#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {144636#false} is VALID [2022-04-15 11:50:44,759 INFO L290 TraceCheckUtils]: 89: Hoare triple {144636#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 90: Hoare triple {144636#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); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 91: Hoare triple {144636#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; {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 92: Hoare triple {144636#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 93: Hoare triple {144636#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); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 94: Hoare triple {144636#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 95: Hoare triple {144636#false} ~skip~0 := 0; {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 96: Hoare triple {144636#false} assume !false; {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 97: Hoare triple {144636#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); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 98: Hoare triple {144636#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 99: Hoare triple {144636#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 100: Hoare triple {144636#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 101: Hoare triple {144636#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 102: Hoare triple {144636#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 103: Hoare triple {144636#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,760 INFO L290 TraceCheckUtils]: 104: Hoare triple {144636#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 105: Hoare triple {144636#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 106: Hoare triple {144636#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 107: Hoare triple {144636#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 108: Hoare triple {144636#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 109: Hoare triple {144636#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 110: Hoare triple {144636#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 111: Hoare triple {144636#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 112: Hoare triple {144636#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 113: Hoare triple {144636#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 114: Hoare triple {144636#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 115: Hoare triple {144636#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 116: Hoare triple {144636#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 117: Hoare triple {144636#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,761 INFO L290 TraceCheckUtils]: 118: Hoare triple {144636#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 119: Hoare triple {144636#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 120: Hoare triple {144636#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 121: Hoare triple {144636#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 122: Hoare triple {144636#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 123: Hoare triple {144636#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 124: Hoare triple {144636#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 125: Hoare triple {144636#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 126: Hoare triple {144636#false} assume 8640 == #t~mem75;havoc #t~mem75; {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 127: Hoare triple {144636#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 128: Hoare triple {144636#false} assume !(9 == ~blastFlag~0); {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 129: Hoare triple {144636#false} assume 12 == ~blastFlag~0; {144636#false} is VALID [2022-04-15 11:50:44,762 INFO L290 TraceCheckUtils]: 130: Hoare triple {144636#false} assume !false; {144636#false} is VALID [2022-04-15 11:50:44,763 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-15 11:50:44,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:44,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621479223] [2022-04-15 11:50:44,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621479223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:44,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:44,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:44,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:44,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [301081223] [2022-04-15 11:50:44,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [301081223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:44,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:44,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:44,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012009165] [2022-04-15 11:50:44,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:44,764 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-15 11:50:44,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:44,764 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-15 11:50:44,845 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-15 11:50:44,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:44,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:44,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:44,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:44,846 INFO L87 Difference]: Start difference. First operand 1080 states and 1706 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-15 11:50:49,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:51,892 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-15 11:50:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:55,690 INFO L93 Difference]: Finished difference Result 2488 states and 3893 transitions. [2022-04-15 11:50:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:55,690 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-15 11:50:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:55,691 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-15 11:50:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:50:55,693 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-15 11:50:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:50:55,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-15 11:50:56,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:56,155 INFO L225 Difference]: With dead ends: 2488 [2022-04-15 11:50:56,155 INFO L226 Difference]: Without dead ends: 1434 [2022-04-15 11:50:56,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:56,156 INFO L913 BasicCegarLoop]: 138 mSDtfsCounter, 121 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 58 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:56,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 391 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 494 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 11:50:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2022-04-15 11:50:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1209. [2022-04-15 11:50:56,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:56,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1434 states. Second operand has 1209 states, 1204 states have (on average 1.590531561461794) internal successors, (1915), 1204 states have internal predecessors, (1915), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:56,222 INFO L74 IsIncluded]: Start isIncluded. First operand 1434 states. Second operand has 1209 states, 1204 states have (on average 1.590531561461794) internal successors, (1915), 1204 states have internal predecessors, (1915), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:56,223 INFO L87 Difference]: Start difference. First operand 1434 states. Second operand has 1209 states, 1204 states have (on average 1.590531561461794) internal successors, (1915), 1204 states have internal predecessors, (1915), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:56,270 INFO L93 Difference]: Finished difference Result 1434 states and 2218 transitions. [2022-04-15 11:50:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2218 transitions. [2022-04-15 11:50:56,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:56,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:56,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 1209 states, 1204 states have (on average 1.590531561461794) internal successors, (1915), 1204 states have internal predecessors, (1915), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1434 states. [2022-04-15 11:50:56,272 INFO L87 Difference]: Start difference. First operand has 1209 states, 1204 states have (on average 1.590531561461794) internal successors, (1915), 1204 states have internal predecessors, (1915), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1434 states. [2022-04-15 11:50:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:56,319 INFO L93 Difference]: Finished difference Result 1434 states and 2218 transitions. [2022-04-15 11:50:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2218 transitions. [2022-04-15 11:50:56,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:56,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:56,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:56,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1204 states have (on average 1.590531561461794) internal successors, (1915), 1204 states have internal predecessors, (1915), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1919 transitions. [2022-04-15 11:50:56,377 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1919 transitions. Word has length 131 [2022-04-15 11:50:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:56,377 INFO L478 AbstractCegarLoop]: Abstraction has 1209 states and 1919 transitions. [2022-04-15 11:50:56,377 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-15 11:50:56,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1209 states and 1919 transitions. [2022-04-15 11:51:00,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1919 edges. 1918 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1919 transitions. [2022-04-15 11:51:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 11:51:00,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:00,348 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-15 11:51:00,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:51:00,349 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash 636807991, now seen corresponding path program 1 times [2022-04-15 11:51:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:00,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [236104575] [2022-04-15 11:51:00,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:00,408 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:00,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash 636807991, now seen corresponding path program 2 times [2022-04-15 11:51:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:00,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780930103] [2022-04-15 11:51:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:00,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:00,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {154916#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {154909#true} is VALID [2022-04-15 11:51:00,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {154909#true} assume true; {154909#true} is VALID [2022-04-15 11:51:00,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154909#true} {154909#true} #710#return; {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {154909#true} call ULTIMATE.init(); {154916#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {154916#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {154909#true} assume true; {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154909#true} {154909#true} #710#return; {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {154909#true} call #t~ret161 := main(); {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {154909#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; {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {154909#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L272 TraceCheckUtils]: 7: Hoare triple {154909#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {154909#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); {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {154909#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; {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {154909#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; {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {154909#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {154909#true} is VALID [2022-04-15 11:51:00,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {154909#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {154909#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {154909#true} assume !false; {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {154909#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); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {154909#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {154909#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {154909#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {154909#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {154909#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {154909#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {154909#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {154909#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {154909#true} assume 8464 == #t~mem55;havoc #t~mem55; {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {154909#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; {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {154909#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {154909#true} is VALID [2022-04-15 11:51:00,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {154909#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); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {154909#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); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {154909#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {154909#true} ~skip~0 := 0; {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {154909#true} assume !false; {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {154909#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); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {154909#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {154909#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {154909#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {154909#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {154909#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {154909#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {154909#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {154909#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {154909#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {154909#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {154909#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {154909#true} assume 8496 == #t~mem58;havoc #t~mem58; {154909#true} is VALID [2022-04-15 11:51:00,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {154909#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {154909#true} is VALID [2022-04-15 11:51:00,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {154909#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {154909#true} is VALID [2022-04-15 11:51:00,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {154909#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {154909#true} is VALID [2022-04-15 11:51:00,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {154909#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {154914#(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); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {154914#(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; {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {154914#(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); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {154914#(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); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {154914#(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); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {154914#(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); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {154914#(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); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {154914#(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); {154914#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:51:00,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {154914#(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); {154915#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-15 11:51:00,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {154915#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {154910#false} is VALID [2022-04-15 11:51:00,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {154910#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; {154910#false} is VALID [2022-04-15 11:51:00,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {154910#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); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {154910#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); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {154910#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {154910#false} ~skip~0 := 0; {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {154910#false} assume !false; {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 68: Hoare triple {154910#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); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {154910#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {154910#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {154910#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {154910#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {154910#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 74: Hoare triple {154910#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 75: Hoare triple {154910#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 76: Hoare triple {154910#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 77: Hoare triple {154910#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,620 INFO L290 TraceCheckUtils]: 78: Hoare triple {154910#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 79: Hoare triple {154910#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 80: Hoare triple {154910#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 81: Hoare triple {154910#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 82: Hoare triple {154910#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 83: Hoare triple {154910#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 84: Hoare triple {154910#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 85: Hoare triple {154910#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 86: Hoare triple {154910#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 87: Hoare triple {154910#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 88: Hoare triple {154910#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 89: Hoare triple {154910#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 90: Hoare triple {154910#false} assume 8448 == #t~mem68;havoc #t~mem68; {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 91: Hoare triple {154910#false} assume !(~num1~0 > 0); {154910#false} is VALID [2022-04-15 11:51:00,621 INFO L290 TraceCheckUtils]: 92: Hoare triple {154910#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; {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 93: Hoare triple {154910#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); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 94: Hoare triple {154910#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 95: Hoare triple {154910#false} ~skip~0 := 0; {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 96: Hoare triple {154910#false} assume !false; {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 97: Hoare triple {154910#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); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 98: Hoare triple {154910#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 99: Hoare triple {154910#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 100: Hoare triple {154910#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 101: Hoare triple {154910#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 102: Hoare triple {154910#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 103: Hoare triple {154910#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 104: Hoare triple {154910#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 105: Hoare triple {154910#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 106: Hoare triple {154910#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,622 INFO L290 TraceCheckUtils]: 107: Hoare triple {154910#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 108: Hoare triple {154910#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 109: Hoare triple {154910#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 110: Hoare triple {154910#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 111: Hoare triple {154910#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 112: Hoare triple {154910#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 113: Hoare triple {154910#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 114: Hoare triple {154910#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 115: Hoare triple {154910#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 116: Hoare triple {154910#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 117: Hoare triple {154910#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 118: Hoare triple {154910#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 119: Hoare triple {154910#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 120: Hoare triple {154910#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 121: Hoare triple {154910#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,623 INFO L290 TraceCheckUtils]: 122: Hoare triple {154910#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 123: Hoare triple {154910#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 124: Hoare triple {154910#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 125: Hoare triple {154910#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 126: Hoare triple {154910#false} assume 8640 == #t~mem75;havoc #t~mem75; {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 127: Hoare triple {154910#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 128: Hoare triple {154910#false} assume !(9 == ~blastFlag~0); {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 129: Hoare triple {154910#false} assume 12 == ~blastFlag~0; {154910#false} is VALID [2022-04-15 11:51:00,624 INFO L290 TraceCheckUtils]: 130: Hoare triple {154910#false} assume !false; {154910#false} is VALID [2022-04-15 11:51:00,624 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-15 11:51:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:00,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780930103] [2022-04-15 11:51:00,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780930103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:00,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:00,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:00,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:00,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [236104575] [2022-04-15 11:51:00,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [236104575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:00,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:00,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:00,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830823721] [2022-04-15 11:51:00,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:00,626 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-15 11:51:00,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:00,626 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-15 11:51:00,687 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-15 11:51:00,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:00,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:00,688 INFO L87 Difference]: Start difference. First operand 1209 states and 1919 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-15 11:51:04,625 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-15 11:51:06,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:09,444 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-15 11:51:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:13,088 INFO L93 Difference]: Finished difference Result 2624 states and 4119 transitions. [2022-04-15 11:51:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:13,088 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-15 11:51:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:13,089 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-15 11:51:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:51:13,091 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-15 11:51:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:51:13,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-15 11:51:13,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:13,546 INFO L225 Difference]: With dead ends: 2624 [2022-04-15 11:51:13,547 INFO L226 Difference]: Without dead ends: 1441 [2022-04-15 11:51:13,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:13,549 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:13,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 362 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 11:51:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-04-15 11:51:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1152. [2022-04-15 11:51:13,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:13,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1441 states. Second operand has 1152 states, 1147 states have (on average 1.5850043591979075) internal successors, (1818), 1147 states have internal predecessors, (1818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:13,627 INFO L74 IsIncluded]: Start isIncluded. First operand 1441 states. Second operand has 1152 states, 1147 states have (on average 1.5850043591979075) internal successors, (1818), 1147 states have internal predecessors, (1818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:13,628 INFO L87 Difference]: Start difference. First operand 1441 states. Second operand has 1152 states, 1147 states have (on average 1.5850043591979075) internal successors, (1818), 1147 states have internal predecessors, (1818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:13,676 INFO L93 Difference]: Finished difference Result 1441 states and 2215 transitions. [2022-04-15 11:51:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2215 transitions. [2022-04-15 11:51:13,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:13,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:13,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 1152 states, 1147 states have (on average 1.5850043591979075) internal successors, (1818), 1147 states have internal predecessors, (1818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1441 states. [2022-04-15 11:51:13,678 INFO L87 Difference]: Start difference. First operand has 1152 states, 1147 states have (on average 1.5850043591979075) internal successors, (1818), 1147 states have internal predecessors, (1818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1441 states. [2022-04-15 11:51:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:13,727 INFO L93 Difference]: Finished difference Result 1441 states and 2215 transitions. [2022-04-15 11:51:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2215 transitions. [2022-04-15 11:51:13,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:13,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:13,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:13,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1147 states have (on average 1.5850043591979075) internal successors, (1818), 1147 states have internal predecessors, (1818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1822 transitions. [2022-04-15 11:51:13,778 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1822 transitions. Word has length 131 [2022-04-15 11:51:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:13,778 INFO L478 AbstractCegarLoop]: Abstraction has 1152 states and 1822 transitions. [2022-04-15 11:51:13,778 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-15 11:51:13,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1152 states and 1822 transitions. [2022-04-15 11:51:17,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1822 edges. 1821 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1822 transitions. [2022-04-15 11:51:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 11:51:17,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:17,658 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-15 11:51:17,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:51:17,658 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash -347293821, now seen corresponding path program 1 times [2022-04-15 11:51:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:17,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470923505] [2022-04-15 11:51:17,735 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:17,735 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:17,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash -347293821, now seen corresponding path program 2 times [2022-04-15 11:51:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:17,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120074258] [2022-04-15 11:51:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:17,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {165362#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {165355#true} is VALID [2022-04-15 11:51:17,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {165355#true} assume true; {165355#true} is VALID [2022-04-15 11:51:17,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165355#true} {165355#true} #710#return; {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {165355#true} call ULTIMATE.init(); {165362#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:51:17,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {165362#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {165355#true} assume true; {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165355#true} {165355#true} #710#return; {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {165355#true} call #t~ret161 := main(); {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {165355#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; {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {165355#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L272 TraceCheckUtils]: 7: Hoare triple {165355#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {165355#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); {165355#true} is VALID [2022-04-15 11:51:17,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {165355#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; {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {165355#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; {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {165355#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {165355#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {165355#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {165355#true} assume !false; {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {165355#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); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {165355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {165355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {165355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {165355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {165355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {165355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {165355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {165355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {165355#true} assume 8464 == #t~mem55;havoc #t~mem55; {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {165355#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; {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {165355#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {165355#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); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {165355#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); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {165355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {165355#true} ~skip~0 := 0; {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {165355#true} assume !false; {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {165355#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); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {165355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {165355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {165355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {165355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {165355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {165355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {165355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {165355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {165355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {165355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {165355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {165355#true} assume 8496 == #t~mem58;havoc #t~mem58; {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {165355#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {165355#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {165355#true} is VALID [2022-04-15 11:51:17,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {165355#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {165355#true} is VALID [2022-04-15 11:51:17,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {165355#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {165360#(= 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; {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,898 INFO L290 TraceCheckUtils]: 64: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,899 INFO L290 TraceCheckUtils]: 65: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,899 INFO L290 TraceCheckUtils]: 66: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,899 INFO L290 TraceCheckUtils]: 67: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,900 INFO L290 TraceCheckUtils]: 68: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,900 INFO L290 TraceCheckUtils]: 69: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,900 INFO L290 TraceCheckUtils]: 70: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,901 INFO L290 TraceCheckUtils]: 71: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,901 INFO L290 TraceCheckUtils]: 73: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,902 INFO L290 TraceCheckUtils]: 77: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,903 INFO L290 TraceCheckUtils]: 78: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,903 INFO L290 TraceCheckUtils]: 79: Hoare triple {165360#(= 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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,903 INFO L290 TraceCheckUtils]: 80: Hoare triple {165360#(= 8656 (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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,904 INFO L290 TraceCheckUtils]: 81: Hoare triple {165360#(= 8656 (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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,904 INFO L290 TraceCheckUtils]: 82: Hoare triple {165360#(= 8656 (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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,904 INFO L290 TraceCheckUtils]: 83: Hoare triple {165360#(= 8656 (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); {165360#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 84: Hoare triple {165360#(= 8656 (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); {165361#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 85: Hoare triple {165361#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 86: Hoare triple {165356#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 87: Hoare triple {165356#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 88: Hoare triple {165356#false} assume 8673 == #t~mem80;havoc #t~mem80; {165356#false} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 89: Hoare triple {165356#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {165356#false} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 90: Hoare triple {165356#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {165356#false} is VALID [2022-04-15 11:51:17,905 INFO L290 TraceCheckUtils]: 91: Hoare triple {165356#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); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 92: Hoare triple {165356#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; {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 93: Hoare triple {165356#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 94: Hoare triple {165356#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); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 95: Hoare triple {165356#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 96: Hoare triple {165356#false} ~skip~0 := 0; {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 97: Hoare triple {165356#false} assume !false; {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 98: Hoare triple {165356#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); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 99: Hoare triple {165356#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 100: Hoare triple {165356#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 101: Hoare triple {165356#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 102: Hoare triple {165356#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 103: Hoare triple {165356#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 104: Hoare triple {165356#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 105: Hoare triple {165356#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,906 INFO L290 TraceCheckUtils]: 106: Hoare triple {165356#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 107: Hoare triple {165356#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 108: Hoare triple {165356#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 109: Hoare triple {165356#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 110: Hoare triple {165356#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 111: Hoare triple {165356#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 112: Hoare triple {165356#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 113: Hoare triple {165356#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 114: Hoare triple {165356#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 115: Hoare triple {165356#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 116: Hoare triple {165356#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 117: Hoare triple {165356#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 118: Hoare triple {165356#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 119: Hoare triple {165356#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 120: Hoare triple {165356#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,907 INFO L290 TraceCheckUtils]: 121: Hoare triple {165356#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 122: Hoare triple {165356#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 123: Hoare triple {165356#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 124: Hoare triple {165356#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 125: Hoare triple {165356#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 126: Hoare triple {165356#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 127: Hoare triple {165356#false} assume 8640 == #t~mem75;havoc #t~mem75; {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 128: Hoare triple {165356#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 129: Hoare triple {165356#false} assume !(9 == ~blastFlag~0); {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 130: Hoare triple {165356#false} assume 12 == ~blastFlag~0; {165356#false} is VALID [2022-04-15 11:51:17,908 INFO L290 TraceCheckUtils]: 131: Hoare triple {165356#false} assume !false; {165356#false} is VALID [2022-04-15 11:51:17,908 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-15 11:51:17,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:17,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120074258] [2022-04-15 11:51:17,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120074258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:17,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:17,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:17,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:17,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470923505] [2022-04-15 11:51:17,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470923505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:17,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:17,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305436628] [2022-04-15 11:51:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:17,910 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-15 11:51:17,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:17,910 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-15 11:51:17,983 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-15 11:51:17,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:17,984 INFO L87 Difference]: Start difference. First operand 1152 states and 1822 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-15 11:51:21,764 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-15 11:51:24,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:25,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:30,752 INFO L93 Difference]: Finished difference Result 2537 states and 3990 transitions. [2022-04-15 11:51:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:30,752 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-15 11:51:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:30,753 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-15 11:51:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2022-04-15 11:51:30,754 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-15 11:51:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2022-04-15 11:51:30,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 555 transitions. [2022-04-15 11:51:31,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 555 edges. 555 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:31,159 INFO L225 Difference]: With dead ends: 2537 [2022-04-15 11:51:31,159 INFO L226 Difference]: Without dead ends: 1411 [2022-04-15 11:51:31,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:31,160 INFO L913 BasicCegarLoop]: 274 mSDtfsCounter, 70 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:31,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 667 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 11:51:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-04-15 11:51:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1281. [2022-04-15 11:51:31,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:31,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1411 states. Second operand has 1281 states, 1276 states have (on average 1.584639498432602) internal successors, (2022), 1276 states have internal predecessors, (2022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:31,246 INFO L74 IsIncluded]: Start isIncluded. First operand 1411 states. Second operand has 1281 states, 1276 states have (on average 1.584639498432602) internal successors, (2022), 1276 states have internal predecessors, (2022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:31,247 INFO L87 Difference]: Start difference. First operand 1411 states. Second operand has 1281 states, 1276 states have (on average 1.584639498432602) internal successors, (2022), 1276 states have internal predecessors, (2022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:31,292 INFO L93 Difference]: Finished difference Result 1411 states and 2198 transitions. [2022-04-15 11:51:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2198 transitions. [2022-04-15 11:51:31,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:31,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:31,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 1281 states, 1276 states have (on average 1.584639498432602) internal successors, (2022), 1276 states have internal predecessors, (2022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1411 states. [2022-04-15 11:51:31,294 INFO L87 Difference]: Start difference. First operand has 1281 states, 1276 states have (on average 1.584639498432602) internal successors, (2022), 1276 states have internal predecessors, (2022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1411 states. [2022-04-15 11:51:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:31,340 INFO L93 Difference]: Finished difference Result 1411 states and 2198 transitions. [2022-04-15 11:51:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2198 transitions. [2022-04-15 11:51:31,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:31,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:31,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:31,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1276 states have (on average 1.584639498432602) internal successors, (2022), 1276 states have internal predecessors, (2022), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 2026 transitions. [2022-04-15 11:51:31,402 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 2026 transitions. Word has length 132 [2022-04-15 11:51:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:31,402 INFO L478 AbstractCegarLoop]: Abstraction has 1281 states and 2026 transitions. [2022-04-15 11:51:31,402 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-15 11:51:31,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1281 states and 2026 transitions. [2022-04-15 11:51:35,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2026 edges. 2025 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2026 transitions. [2022-04-15 11:51:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 11:51:35,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:35,517 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-15 11:51:35,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:51:35,517 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:35,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2068542529, now seen corresponding path program 1 times [2022-04-15 11:51:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:35,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190930480] [2022-04-15 11:51:35,600 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:35,601 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:35,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2068542529, now seen corresponding path program 2 times [2022-04-15 11:51:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:35,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395502141] [2022-04-15 11:51:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:35,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {175832#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {175825#true} is VALID [2022-04-15 11:51:35,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {175825#true} assume true; {175825#true} is VALID [2022-04-15 11:51:35,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175825#true} {175825#true} #710#return; {175825#true} is VALID [2022-04-15 11:51:35,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {175825#true} call ULTIMATE.init(); {175832#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:51:35,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {175832#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {175825#true} is VALID [2022-04-15 11:51:35,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {175825#true} assume true; {175825#true} is VALID [2022-04-15 11:51:35,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175825#true} {175825#true} #710#return; {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {175825#true} call #t~ret161 := main(); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {175825#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; {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {175825#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L272 TraceCheckUtils]: 7: Hoare triple {175825#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {175825#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); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {175825#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; {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {175825#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; {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {175825#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {175825#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {175825#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {175825#true} assume !false; {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {175825#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); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {175825#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {175825#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {175825#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {175825#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {175825#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {175825#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {175825#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {175825#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {175825#true} assume 8464 == #t~mem55;havoc #t~mem55; {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {175825#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; {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {175825#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {175825#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); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {175825#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); {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {175825#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {175825#true} ~skip~0 := 0; {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {175825#true} assume !false; {175825#true} is VALID [2022-04-15 11:51:35,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {175825#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); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {175825#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {175825#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {175825#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {175825#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {175825#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {175825#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {175825#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {175825#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {175825#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {175825#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {175825#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {175825#true} assume 8496 == #t~mem58;havoc #t~mem58; {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {175825#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {175825#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {175825#true} is VALID [2022-04-15 11:51:35,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {175825#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {175825#true} is VALID [2022-04-15 11:51:35,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {175825#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {175830#(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; {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,784 INFO L290 TraceCheckUtils]: 75: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,785 INFO L290 TraceCheckUtils]: 77: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,792 INFO L290 TraceCheckUtils]: 79: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,792 INFO L290 TraceCheckUtils]: 80: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,793 INFO L290 TraceCheckUtils]: 81: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,793 INFO L290 TraceCheckUtils]: 82: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,793 INFO L290 TraceCheckUtils]: 83: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {175830#(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); {175830#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:35,795 INFO L290 TraceCheckUtils]: 87: Hoare triple {175830#(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); {175831#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-15 11:51:35,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {175831#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {175826#false} is VALID [2022-04-15 11:51:35,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {175826#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {175826#false} is VALID [2022-04-15 11:51:35,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {175826#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {175826#false} is VALID [2022-04-15 11:51:35,795 INFO L290 TraceCheckUtils]: 91: Hoare triple {175826#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); {175826#false} is VALID [2022-04-15 11:51:35,795 INFO L290 TraceCheckUtils]: 92: Hoare triple {175826#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; {175826#false} is VALID [2022-04-15 11:51:35,795 INFO L290 TraceCheckUtils]: 93: Hoare triple {175826#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 94: Hoare triple {175826#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); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 95: Hoare triple {175826#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 96: Hoare triple {175826#false} ~skip~0 := 0; {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 97: Hoare triple {175826#false} assume !false; {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {175826#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); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {175826#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {175826#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {175826#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 102: Hoare triple {175826#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 103: Hoare triple {175826#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 104: Hoare triple {175826#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 105: Hoare triple {175826#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 106: Hoare triple {175826#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 107: Hoare triple {175826#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,796 INFO L290 TraceCheckUtils]: 108: Hoare triple {175826#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 109: Hoare triple {175826#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {175826#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 111: Hoare triple {175826#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 112: Hoare triple {175826#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 113: Hoare triple {175826#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 114: Hoare triple {175826#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 115: Hoare triple {175826#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 116: Hoare triple {175826#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 117: Hoare triple {175826#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 118: Hoare triple {175826#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 119: Hoare triple {175826#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 120: Hoare triple {175826#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 121: Hoare triple {175826#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,797 INFO L290 TraceCheckUtils]: 122: Hoare triple {175826#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 123: Hoare triple {175826#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 124: Hoare triple {175826#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 125: Hoare triple {175826#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 126: Hoare triple {175826#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 127: Hoare triple {175826#false} assume 8640 == #t~mem75;havoc #t~mem75; {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 128: Hoare triple {175826#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 129: Hoare triple {175826#false} assume !(9 == ~blastFlag~0); {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 130: Hoare triple {175826#false} assume 12 == ~blastFlag~0; {175826#false} is VALID [2022-04-15 11:51:35,798 INFO L290 TraceCheckUtils]: 131: Hoare triple {175826#false} assume !false; {175826#false} is VALID [2022-04-15 11:51:35,799 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-15 11:51:35,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:35,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395502141] [2022-04-15 11:51:35,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395502141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:35,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:35,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:35,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190930480] [2022-04-15 11:51:35,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190930480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:35,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29520331] [2022-04-15 11:51:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:35,800 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-15 11:51:35,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:35,800 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-15 11:51:35,874 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-15 11:51:35,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:35,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:35,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:35,875 INFO L87 Difference]: Start difference. First operand 1281 states and 2026 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-15 11:51:37,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:41,779 INFO L93 Difference]: Finished difference Result 2768 states and 4334 transitions. [2022-04-15 11:51:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:41,779 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-15 11:51:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:41,779 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-15 11:51:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-15 11:51:41,782 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-15 11:51:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-15 11:51:41,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-15 11:51:42,165 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-15 11:51:42,246 INFO L225 Difference]: With dead ends: 2768 [2022-04-15 11:51:42,246 INFO L226 Difference]: Without dead ends: 1507 [2022-04-15 11:51:42,248 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:42,248 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 121 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:42,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 382 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 11:51:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-04-15 11:51:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1287. [2022-04-15 11:51:42,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:42,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1507 states. Second operand has 1287 states, 1282 states have (on average 1.5842433697347893) internal successors, (2031), 1282 states have internal predecessors, (2031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,332 INFO L74 IsIncluded]: Start isIncluded. First operand 1507 states. Second operand has 1287 states, 1282 states have (on average 1.5842433697347893) internal successors, (2031), 1282 states have internal predecessors, (2031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,333 INFO L87 Difference]: Start difference. First operand 1507 states. Second operand has 1287 states, 1282 states have (on average 1.5842433697347893) internal successors, (2031), 1282 states have internal predecessors, (2031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:42,385 INFO L93 Difference]: Finished difference Result 1507 states and 2329 transitions. [2022-04-15 11:51:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2329 transitions. [2022-04-15 11:51:42,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:42,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:42,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 1287 states, 1282 states have (on average 1.5842433697347893) internal successors, (2031), 1282 states have internal predecessors, (2031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1507 states. [2022-04-15 11:51:42,387 INFO L87 Difference]: Start difference. First operand has 1287 states, 1282 states have (on average 1.5842433697347893) internal successors, (2031), 1282 states have internal predecessors, (2031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1507 states. [2022-04-15 11:51:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:42,439 INFO L93 Difference]: Finished difference Result 1507 states and 2329 transitions. [2022-04-15 11:51:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2329 transitions. [2022-04-15 11:51:42,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:42,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:42,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:42,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1282 states have (on average 1.5842433697347893) internal successors, (2031), 1282 states have internal predecessors, (2031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2035 transitions. [2022-04-15 11:51:42,502 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2035 transitions. Word has length 132 [2022-04-15 11:51:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:42,503 INFO L478 AbstractCegarLoop]: Abstraction has 1287 states and 2035 transitions. [2022-04-15 11:51:42,503 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-15 11:51:42,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1287 states and 2035 transitions. [2022-04-15 11:51:46,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2035 edges. 2034 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2035 transitions. [2022-04-15 11:51:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 11:51:46,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:46,707 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-15 11:51:46,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:51:46,707 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:46,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash -231720393, now seen corresponding path program 1 times [2022-04-15 11:51:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:46,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257617577] [2022-04-15 11:51:46,787 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:46,787 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:46,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -231720393, now seen corresponding path program 2 times [2022-04-15 11:51:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578643413] [2022-04-15 11:51:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:46,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {186968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {186961#true} is VALID [2022-04-15 11:51:46,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {186961#true} assume true; {186961#true} is VALID [2022-04-15 11:51:46,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186961#true} {186961#true} #710#return; {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {186961#true} call ULTIMATE.init(); {186968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:51:46,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {186968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {186961#true} assume true; {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186961#true} {186961#true} #710#return; {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {186961#true} call #t~ret161 := main(); {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {186961#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; {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {186961#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L272 TraceCheckUtils]: 7: Hoare triple {186961#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {186961#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); {186961#true} is VALID [2022-04-15 11:51:46,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {186961#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; {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {186961#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; {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {186961#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {186961#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {186961#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {186961#true} assume !false; {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {186961#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); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {186961#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {186961#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {186961#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {186961#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {186961#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {186961#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {186961#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {186961#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {186961#true} assume 8464 == #t~mem55;havoc #t~mem55; {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {186961#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; {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {186961#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {186961#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); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {186961#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); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {186961#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {186961#true} ~skip~0 := 0; {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {186961#true} assume !false; {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {186961#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); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {186961#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {186961#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {186961#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {186961#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {186961#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {186961#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {186961#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {186961#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {186961#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {186961#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {186961#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {186961#true} assume 8496 == #t~mem58;havoc #t~mem58; {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {186961#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {186961#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {186961#true} is VALID [2022-04-15 11:51:46,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {186961#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {186961#true} is VALID [2022-04-15 11:51:46,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {186961#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {186966#(= 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; {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,978 INFO L290 TraceCheckUtils]: 69: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {186966#(= 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); {186966#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:46,980 INFO L290 TraceCheckUtils]: 73: Hoare triple {186966#(= 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); {186967#(= |ssl3_accept_#t~mem66| 8656)} is VALID [2022-04-15 11:51:46,980 INFO L290 TraceCheckUtils]: 74: Hoare triple {186967#(= |ssl3_accept_#t~mem66| 8656)} assume 8560 == #t~mem66;havoc #t~mem66; {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 75: Hoare triple {186962#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 76: Hoare triple {186962#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); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {186962#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); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {186962#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 79: Hoare triple {186962#false} ~skip~0 := 0; {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 80: Hoare triple {186962#false} assume !false; {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 81: Hoare triple {186962#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); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 82: Hoare triple {186962#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 83: Hoare triple {186962#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 84: Hoare triple {186962#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 85: Hoare triple {186962#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 86: Hoare triple {186962#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 87: Hoare triple {186962#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,981 INFO L290 TraceCheckUtils]: 88: Hoare triple {186962#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 89: Hoare triple {186962#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 90: Hoare triple {186962#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 91: Hoare triple {186962#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 92: Hoare triple {186962#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 93: Hoare triple {186962#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 94: Hoare triple {186962#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 95: Hoare triple {186962#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 96: Hoare triple {186962#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 97: Hoare triple {186962#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 98: Hoare triple {186962#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 99: Hoare triple {186962#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 100: Hoare triple {186962#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 101: Hoare triple {186962#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 102: Hoare triple {186962#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,982 INFO L290 TraceCheckUtils]: 103: Hoare triple {186962#false} assume 8448 == #t~mem68;havoc #t~mem68; {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 104: Hoare triple {186962#false} assume !(~num1~0 > 0); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 105: Hoare triple {186962#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; {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 106: Hoare triple {186962#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); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 107: Hoare triple {186962#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 108: Hoare triple {186962#false} ~skip~0 := 0; {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 109: Hoare triple {186962#false} assume !false; {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 110: Hoare triple {186962#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); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 111: Hoare triple {186962#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 112: Hoare triple {186962#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 113: Hoare triple {186962#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 114: Hoare triple {186962#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 115: Hoare triple {186962#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 116: Hoare triple {186962#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,983 INFO L290 TraceCheckUtils]: 117: Hoare triple {186962#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 118: Hoare triple {186962#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 119: Hoare triple {186962#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 120: Hoare triple {186962#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 121: Hoare triple {186962#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 122: Hoare triple {186962#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 123: Hoare triple {186962#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 124: Hoare triple {186962#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 125: Hoare triple {186962#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 126: Hoare triple {186962#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 127: Hoare triple {186962#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 128: Hoare triple {186962#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 129: Hoare triple {186962#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 130: Hoare triple {186962#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,984 INFO L290 TraceCheckUtils]: 131: Hoare triple {186962#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 132: Hoare triple {186962#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 133: Hoare triple {186962#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 134: Hoare triple {186962#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 135: Hoare triple {186962#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 136: Hoare triple {186962#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 137: Hoare triple {186962#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 138: Hoare triple {186962#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 139: Hoare triple {186962#false} assume 8640 == #t~mem75;havoc #t~mem75; {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 140: Hoare triple {186962#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 141: Hoare triple {186962#false} assume !(9 == ~blastFlag~0); {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 142: Hoare triple {186962#false} assume 12 == ~blastFlag~0; {186962#false} is VALID [2022-04-15 11:51:46,985 INFO L290 TraceCheckUtils]: 143: Hoare triple {186962#false} assume !false; {186962#false} is VALID [2022-04-15 11:51:46,986 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-15 11:51:46,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:46,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578643413] [2022-04-15 11:51:46,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578643413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:46,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:46,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:46,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:46,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257617577] [2022-04-15 11:51:46,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257617577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:46,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:46,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973303648] [2022-04-15 11:51:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:46,987 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-15 11:51:46,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:46,987 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-15 11:51:47,053 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-15 11:51:47,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:47,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:47,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:47,054 INFO L87 Difference]: Start difference. First operand 1287 states and 2035 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-15 11:51:50,132 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-15 11:51:54,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:01,798 INFO L93 Difference]: Finished difference Result 2678 states and 4209 transitions. [2022-04-15 11:52:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:01,798 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-15 11:52:01,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:01,798 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-15 11:52:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2022-04-15 11:52:01,800 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-15 11:52:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2022-04-15 11:52:01,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 554 transitions. [2022-04-15 11:52:02,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 554 edges. 554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:02,199 INFO L225 Difference]: With dead ends: 2678 [2022-04-15 11:52:02,199 INFO L226 Difference]: Without dead ends: 1417 [2022-04-15 11:52:02,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:02,201 INFO L913 BasicCegarLoop]: 274 mSDtfsCounter, 80 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:02,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 667 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 602 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:52:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2022-04-15 11:52:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1287. [2022-04-15 11:52:02,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:02,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1417 states. Second operand has 1287 states, 1282 states have (on average 1.5819032761310452) internal successors, (2028), 1282 states have internal predecessors, (2028), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:02,293 INFO L74 IsIncluded]: Start isIncluded. First operand 1417 states. Second operand has 1287 states, 1282 states have (on average 1.5819032761310452) internal successors, (2028), 1282 states have internal predecessors, (2028), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:02,294 INFO L87 Difference]: Start difference. First operand 1417 states. Second operand has 1287 states, 1282 states have (on average 1.5819032761310452) internal successors, (2028), 1282 states have internal predecessors, (2028), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:02,340 INFO L93 Difference]: Finished difference Result 1417 states and 2204 transitions. [2022-04-15 11:52:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2204 transitions. [2022-04-15 11:52:02,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:02,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:02,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 1287 states, 1282 states have (on average 1.5819032761310452) internal successors, (2028), 1282 states have internal predecessors, (2028), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1417 states. [2022-04-15 11:52:02,343 INFO L87 Difference]: Start difference. First operand has 1287 states, 1282 states have (on average 1.5819032761310452) internal successors, (2028), 1282 states have internal predecessors, (2028), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1417 states. [2022-04-15 11:52:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:02,390 INFO L93 Difference]: Finished difference Result 1417 states and 2204 transitions. [2022-04-15 11:52:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2204 transitions. [2022-04-15 11:52:02,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:02,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:02,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:02,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1282 states have (on average 1.5819032761310452) internal successors, (2028), 1282 states have internal predecessors, (2028), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2032 transitions. [2022-04-15 11:52:02,452 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2032 transitions. Word has length 144 [2022-04-15 11:52:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:02,453 INFO L478 AbstractCegarLoop]: Abstraction has 1287 states and 2032 transitions. [2022-04-15 11:52:02,453 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-15 11:52:02,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1287 states and 2032 transitions. [2022-04-15 11:52:06,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2032 edges. 2031 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2032 transitions. [2022-04-15 11:52:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 11:52:06,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:06,692 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-15 11:52:06,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 11:52:06,693 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1288451595, now seen corresponding path program 1 times [2022-04-15 11:52:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:06,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546992699] [2022-04-15 11:52:06,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:06,762 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:06,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1288451595, now seen corresponding path program 2 times [2022-04-15 11:52:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:06,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135993762] [2022-04-15 11:52:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:06,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {197744#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {197737#true} is VALID [2022-04-15 11:52:06,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {197737#true} assume true; {197737#true} is VALID [2022-04-15 11:52:06,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197737#true} {197737#true} #710#return; {197737#true} is VALID [2022-04-15 11:52:06,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {197737#true} call ULTIMATE.init(); {197744#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:52:06,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {197744#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {197737#true} is VALID [2022-04-15 11:52:06,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {197737#true} assume true; {197737#true} is VALID [2022-04-15 11:52:06,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197737#true} {197737#true} #710#return; {197737#true} is VALID [2022-04-15 11:52:06,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {197737#true} call #t~ret161 := main(); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {197737#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; {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {197737#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L272 TraceCheckUtils]: 7: Hoare triple {197737#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {197737#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); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {197737#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; {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {197737#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; {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {197737#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {197737#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {197737#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {197737#true} assume !false; {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {197737#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); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {197737#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {197737#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {197737#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {197737#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {197737#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {197737#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {197737#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {197737#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {197737#true} assume 8464 == #t~mem55;havoc #t~mem55; {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {197737#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; {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {197737#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {197737#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); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {197737#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); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {197737#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {197737#true} ~skip~0 := 0; {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {197737#true} assume !false; {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {197737#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); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {197737#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {197737#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {197737#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {197737#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {197737#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {197737#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {197737#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {197737#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {197737#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {197737#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {197737#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {197737#true} assume 8496 == #t~mem58;havoc #t~mem58; {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {197737#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {197737#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {197737#true} is VALID [2022-04-15 11:52:06,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {197737#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {197737#true} is VALID [2022-04-15 11:52:06,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {197737#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {197742#(= (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; {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,930 INFO L290 TraceCheckUtils]: 59: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,931 INFO L290 TraceCheckUtils]: 60: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,931 INFO L290 TraceCheckUtils]: 61: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,933 INFO L290 TraceCheckUtils]: 66: Hoare triple {197742#(= (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); {197742#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:52:06,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {197742#(= (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); {197743#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-15 11:52:06,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {197743#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {197738#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {197738#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {197738#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 72: Hoare triple {197738#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {197738#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 74: Hoare triple {197738#false} assume 8560 == #t~mem66;havoc #t~mem66; {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 75: Hoare triple {197738#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 76: Hoare triple {197738#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); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 77: Hoare triple {197738#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); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 78: Hoare triple {197738#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 79: Hoare triple {197738#false} ~skip~0 := 0; {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 80: Hoare triple {197738#false} assume !false; {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 81: Hoare triple {197738#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); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 82: Hoare triple {197738#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 83: Hoare triple {197738#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 84: Hoare triple {197738#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 85: Hoare triple {197738#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 86: Hoare triple {197738#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,934 INFO L290 TraceCheckUtils]: 87: Hoare triple {197738#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 88: Hoare triple {197738#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 89: Hoare triple {197738#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 90: Hoare triple {197738#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {197738#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {197738#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 93: Hoare triple {197738#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 94: Hoare triple {197738#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 95: Hoare triple {197738#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 96: Hoare triple {197738#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 97: Hoare triple {197738#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 98: Hoare triple {197738#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 99: Hoare triple {197738#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 100: Hoare triple {197738#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,935 INFO L290 TraceCheckUtils]: 101: Hoare triple {197738#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 102: Hoare triple {197738#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 103: Hoare triple {197738#false} assume 8448 == #t~mem68;havoc #t~mem68; {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 104: Hoare triple {197738#false} assume !(~num1~0 > 0); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 105: Hoare triple {197738#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; {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 106: Hoare triple {197738#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); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 107: Hoare triple {197738#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 108: Hoare triple {197738#false} ~skip~0 := 0; {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 109: Hoare triple {197738#false} assume !false; {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 110: Hoare triple {197738#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); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 111: Hoare triple {197738#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 112: Hoare triple {197738#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 113: Hoare triple {197738#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {197738#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 115: Hoare triple {197738#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 116: Hoare triple {197738#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,936 INFO L290 TraceCheckUtils]: 117: Hoare triple {197738#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 118: Hoare triple {197738#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 119: Hoare triple {197738#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 120: Hoare triple {197738#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 121: Hoare triple {197738#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 122: Hoare triple {197738#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 123: Hoare triple {197738#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 124: Hoare triple {197738#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 125: Hoare triple {197738#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 126: Hoare triple {197738#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 127: Hoare triple {197738#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 128: Hoare triple {197738#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 129: Hoare triple {197738#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 130: Hoare triple {197738#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 131: Hoare triple {197738#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,937 INFO L290 TraceCheckUtils]: 132: Hoare triple {197738#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 133: Hoare triple {197738#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 134: Hoare triple {197738#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 135: Hoare triple {197738#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 136: Hoare triple {197738#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 137: Hoare triple {197738#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 138: Hoare triple {197738#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 139: Hoare triple {197738#false} assume 8640 == #t~mem75;havoc #t~mem75; {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 140: Hoare triple {197738#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 141: Hoare triple {197738#false} assume !(9 == ~blastFlag~0); {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 142: Hoare triple {197738#false} assume 12 == ~blastFlag~0; {197738#false} is VALID [2022-04-15 11:52:06,938 INFO L290 TraceCheckUtils]: 143: Hoare triple {197738#false} assume !false; {197738#false} is VALID [2022-04-15 11:52:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-15 11:52:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135993762] [2022-04-15 11:52:06,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135993762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:06,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:06,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:06,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546992699] [2022-04-15 11:52:06,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546992699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:06,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:06,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485374325] [2022-04-15 11:52:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:06,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have 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-15 11:52:06,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:06,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:07,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:07,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:07,002 INFO L87 Difference]: Start difference. First operand 1287 states and 2032 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:10,239 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-15 11:52:13,465 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-15 11:52:15,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:17,543 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-15 11:52:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:21,608 INFO L93 Difference]: Finished difference Result 2684 states and 4227 transitions. [2022-04-15 11:52:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:21,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have 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-15 11:52:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-15 11:52:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-15 11:52:21,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 493 transitions. [2022-04-15 11:52:21,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:21,971 INFO L225 Difference]: With dead ends: 2684 [2022-04-15 11:52:21,971 INFO L226 Difference]: Without dead ends: 1423 [2022-04-15 11:52:21,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:21,973 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 37 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:21,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 623 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 467 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2022-04-15 11:52:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-04-15 11:52:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1359. [2022-04-15 11:52:22,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:22,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1423 states. Second operand has 1359 states, 1354 states have (on average 1.5797636632200887) internal successors, (2139), 1354 states have internal predecessors, (2139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:22,062 INFO L74 IsIncluded]: Start isIncluded. First operand 1423 states. Second operand has 1359 states, 1354 states have (on average 1.5797636632200887) internal successors, (2139), 1354 states have internal predecessors, (2139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:22,063 INFO L87 Difference]: Start difference. First operand 1423 states. Second operand has 1359 states, 1354 states have (on average 1.5797636632200887) internal successors, (2139), 1354 states have internal predecessors, (2139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:22,109 INFO L93 Difference]: Finished difference Result 1423 states and 2225 transitions. [2022-04-15 11:52:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2225 transitions. [2022-04-15 11:52:22,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:22,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:22,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 1359 states, 1354 states have (on average 1.5797636632200887) internal successors, (2139), 1354 states have internal predecessors, (2139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1423 states. [2022-04-15 11:52:22,112 INFO L87 Difference]: Start difference. First operand has 1359 states, 1354 states have (on average 1.5797636632200887) internal successors, (2139), 1354 states have internal predecessors, (2139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1423 states. [2022-04-15 11:52:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:22,159 INFO L93 Difference]: Finished difference Result 1423 states and 2225 transitions. [2022-04-15 11:52:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2225 transitions. [2022-04-15 11:52:22,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:22,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:22,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:22,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1354 states have (on average 1.5797636632200887) internal successors, (2139), 1354 states have internal predecessors, (2139), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2143 transitions. [2022-04-15 11:52:22,230 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2143 transitions. Word has length 144 [2022-04-15 11:52:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:22,230 INFO L478 AbstractCegarLoop]: Abstraction has 1359 states and 2143 transitions. [2022-04-15 11:52:22,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:22,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2143 transitions. [2022-04-15 11:52:26,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2143 edges. 2142 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2143 transitions. [2022-04-15 11:52:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:52:26,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:26,528 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-15 11:52:26,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 11:52:26,528 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash -901822382, now seen corresponding path program 1 times [2022-04-15 11:52:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:26,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1210352564] [2022-04-15 11:52:26,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:26,595 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:26,595 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash -901822382, now seen corresponding path program 2 times [2022-04-15 11:52:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:26,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556875385] [2022-04-15 11:52:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:26,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {208688#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {208681#true} is VALID [2022-04-15 11:52:26,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {208681#true} assume true; {208681#true} is VALID [2022-04-15 11:52:26,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208681#true} {208681#true} #710#return; {208681#true} is VALID [2022-04-15 11:52:26,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {208681#true} call ULTIMATE.init(); {208688#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:52:26,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {208688#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {208681#true} assume true; {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208681#true} {208681#true} #710#return; {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {208681#true} call #t~ret161 := main(); {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {208681#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; {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {208681#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L272 TraceCheckUtils]: 7: Hoare triple {208681#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {208681#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); {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {208681#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; {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {208681#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; {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {208681#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {208681#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {208681#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {208681#true} assume !false; {208681#true} is VALID [2022-04-15 11:52:26,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {208681#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); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {208681#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {208681#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {208681#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {208681#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {208681#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {208681#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {208681#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {208681#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {208681#true} assume 8464 == #t~mem55;havoc #t~mem55; {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {208681#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; {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {208681#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {208681#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); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {208681#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); {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {208681#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208681#true} is VALID [2022-04-15 11:52:26,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {208681#true} ~skip~0 := 0; {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {208681#true} assume !false; {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {208681#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); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {208681#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {208681#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {208681#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {208681#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {208681#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {208681#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {208681#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {208681#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {208681#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {208681#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {208681#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {208681#true} assume 8496 == #t~mem58;havoc #t~mem58; {208681#true} is VALID [2022-04-15 11:52:26,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {208681#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {208681#true} is VALID [2022-04-15 11:52:26,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {208681#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {208681#true} is VALID [2022-04-15 11:52:26,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {208681#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {208681#true} is VALID [2022-04-15 11:52:26,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {208681#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {208686#(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; {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,783 INFO L290 TraceCheckUtils]: 68: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,783 INFO L290 TraceCheckUtils]: 69: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {208686#(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); {208686#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:26,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {208686#(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); {208687#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-15 11:52:26,795 INFO L290 TraceCheckUtils]: 75: Hoare triple {208687#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {208682#false} is VALID [2022-04-15 11:52:26,795 INFO L290 TraceCheckUtils]: 76: Hoare triple {208682#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {208682#false} is VALID [2022-04-15 11:52:26,795 INFO L290 TraceCheckUtils]: 77: Hoare triple {208682#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); {208682#false} is VALID [2022-04-15 11:52:26,795 INFO L290 TraceCheckUtils]: 78: Hoare triple {208682#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); {208682#false} is VALID [2022-04-15 11:52:26,795 INFO L290 TraceCheckUtils]: 79: Hoare triple {208682#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {208682#false} ~skip~0 := 0; {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {208682#false} assume !false; {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 82: Hoare triple {208682#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); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 83: Hoare triple {208682#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 84: Hoare triple {208682#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {208682#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 86: Hoare triple {208682#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 87: Hoare triple {208682#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 88: Hoare triple {208682#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 89: Hoare triple {208682#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 90: Hoare triple {208682#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 91: Hoare triple {208682#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,796 INFO L290 TraceCheckUtils]: 92: Hoare triple {208682#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 93: Hoare triple {208682#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 94: Hoare triple {208682#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 95: Hoare triple {208682#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 96: Hoare triple {208682#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 97: Hoare triple {208682#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 98: Hoare triple {208682#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 99: Hoare triple {208682#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 100: Hoare triple {208682#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 101: Hoare triple {208682#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {208682#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 103: Hoare triple {208682#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 104: Hoare triple {208682#false} assume 8448 == #t~mem68;havoc #t~mem68; {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {208682#false} assume !(~num1~0 > 0); {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {208682#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; {208682#false} is VALID [2022-04-15 11:52:26,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {208682#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); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 108: Hoare triple {208682#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 109: Hoare triple {208682#false} ~skip~0 := 0; {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 110: Hoare triple {208682#false} assume !false; {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 111: Hoare triple {208682#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); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 112: Hoare triple {208682#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 113: Hoare triple {208682#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 114: Hoare triple {208682#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 115: Hoare triple {208682#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 116: Hoare triple {208682#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 117: Hoare triple {208682#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 118: Hoare triple {208682#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 119: Hoare triple {208682#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 120: Hoare triple {208682#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 121: Hoare triple {208682#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,798 INFO L290 TraceCheckUtils]: 122: Hoare triple {208682#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 123: Hoare triple {208682#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 124: Hoare triple {208682#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 125: Hoare triple {208682#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 126: Hoare triple {208682#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 127: Hoare triple {208682#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 128: Hoare triple {208682#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 129: Hoare triple {208682#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 130: Hoare triple {208682#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 131: Hoare triple {208682#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 132: Hoare triple {208682#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 133: Hoare triple {208682#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 134: Hoare triple {208682#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 135: Hoare triple {208682#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,799 INFO L290 TraceCheckUtils]: 136: Hoare triple {208682#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 137: Hoare triple {208682#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 138: Hoare triple {208682#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 139: Hoare triple {208682#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 140: Hoare triple {208682#false} assume 8640 == #t~mem75;havoc #t~mem75; {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 141: Hoare triple {208682#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 142: Hoare triple {208682#false} assume !(9 == ~blastFlag~0); {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 143: Hoare triple {208682#false} assume 12 == ~blastFlag~0; {208682#false} is VALID [2022-04-15 11:52:26,800 INFO L290 TraceCheckUtils]: 144: Hoare triple {208682#false} assume !false; {208682#false} is VALID [2022-04-15 11:52:26,800 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-15 11:52:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:26,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556875385] [2022-04-15 11:52:26,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556875385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:26,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:26,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:26,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:26,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1210352564] [2022-04-15 11:52:26,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1210352564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:26,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:26,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:26,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102042907] [2022-04-15 11:52:26,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:26,802 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-15 11:52:26,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:26,802 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-15 11:52:26,871 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-15 11:52:26,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:26,872 INFO L87 Difference]: Start difference. First operand 1359 states and 2143 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-15 11:52:36,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:40,419 INFO L93 Difference]: Finished difference Result 2912 states and 4547 transitions. [2022-04-15 11:52:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:40,419 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-15 11:52:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:40,419 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-15 11:52:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:52:40,421 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-15 11:52:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:52:40,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-15 11:52:40,796 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-15 11:52:40,895 INFO L225 Difference]: With dead ends: 2912 [2022-04-15 11:52:40,895 INFO L226 Difference]: Without dead ends: 1579 [2022-04-15 11:52:40,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:40,897 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 131 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:40,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 384 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 11:52:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-04-15 11:52:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1359. [2022-04-15 11:52:40,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:40,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1579 states. Second operand has 1359 states, 1354 states have (on average 1.5642540620384047) internal successors, (2118), 1354 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:40,991 INFO L74 IsIncluded]: Start isIncluded. First operand 1579 states. Second operand has 1359 states, 1354 states have (on average 1.5642540620384047) internal successors, (2118), 1354 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:40,992 INFO L87 Difference]: Start difference. First operand 1579 states. Second operand has 1359 states, 1354 states have (on average 1.5642540620384047) internal successors, (2118), 1354 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:41,054 INFO L93 Difference]: Finished difference Result 1579 states and 2416 transitions. [2022-04-15 11:52:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2416 transitions. [2022-04-15 11:52:41,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:41,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:41,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 1359 states, 1354 states have (on average 1.5642540620384047) internal successors, (2118), 1354 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1579 states. [2022-04-15 11:52:41,057 INFO L87 Difference]: Start difference. First operand has 1359 states, 1354 states have (on average 1.5642540620384047) internal successors, (2118), 1354 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1579 states. [2022-04-15 11:52:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:41,119 INFO L93 Difference]: Finished difference Result 1579 states and 2416 transitions. [2022-04-15 11:52:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2416 transitions. [2022-04-15 11:52:41,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:41,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:41,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:41,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1354 states have (on average 1.5642540620384047) internal successors, (2118), 1354 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2122 transitions. [2022-04-15 11:52:41,190 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2122 transitions. Word has length 145 [2022-04-15 11:52:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:41,191 INFO L478 AbstractCegarLoop]: Abstraction has 1359 states and 2122 transitions. [2022-04-15 11:52:41,191 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-15 11:52:41,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2122 transitions. [2022-04-15 11:52:45,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2122 edges. 2121 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2122 transitions. [2022-04-15 11:52:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 11:52:45,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:45,553 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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-15 11:52:45,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 11:52:45,553 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash -250376814, now seen corresponding path program 1 times [2022-04-15 11:52:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:45,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621085083] [2022-04-15 11:52:45,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:45,632 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:45,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash -250376814, now seen corresponding path program 2 times [2022-04-15 11:52:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:45,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167328686] [2022-04-15 11:52:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:45,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {220400#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {220393#true} is VALID [2022-04-15 11:52:45,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {220393#true} assume true; {220393#true} is VALID [2022-04-15 11:52:45,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220393#true} {220393#true} #710#return; {220393#true} is VALID [2022-04-15 11:52:45,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {220393#true} call ULTIMATE.init(); {220400#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {220400#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {220393#true} assume true; {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220393#true} {220393#true} #710#return; {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {220393#true} call #t~ret161 := main(); {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {220393#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; {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {220393#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L272 TraceCheckUtils]: 7: Hoare triple {220393#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {220393#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); {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {220393#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; {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {220393#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; {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {220393#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {220393#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {220393#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {220393#true} is VALID [2022-04-15 11:52:45,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {220393#true} assume !false; {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {220393#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); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {220393#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {220393#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {220393#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {220393#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {220393#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {220393#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {220393#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {220393#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {220393#true} assume 8464 == #t~mem55;havoc #t~mem55; {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {220393#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; {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {220393#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {220393#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); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {220393#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); {220393#true} is VALID [2022-04-15 11:52:45,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {220393#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {220393#true} ~skip~0 := 0; {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {220393#true} assume !false; {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {220393#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); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {220393#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {220393#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {220393#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {220393#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {220393#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {220393#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {220393#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {220393#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {220393#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {220393#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {220393#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {220393#true} assume 8496 == #t~mem58;havoc #t~mem58; {220393#true} is VALID [2022-04-15 11:52:45,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {220393#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {220393#true} is VALID [2022-04-15 11:52:45,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {220393#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220393#true} is VALID [2022-04-15 11:52:45,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {220393#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {220393#true} is VALID [2022-04-15 11:52:45,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {220393#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {220398#(= 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); {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {220398#(= 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; {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {220398#(= 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); {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,815 INFO L290 TraceCheckUtils]: 55: Hoare triple {220398#(= 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); {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {220398#(= 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); {220398#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:45,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {220398#(= 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); {220399#(= |ssl3_accept_#t~mem50| 8656)} is VALID [2022-04-15 11:52:45,816 INFO L290 TraceCheckUtils]: 58: Hoare triple {220399#(= |ssl3_accept_#t~mem50| 8656)} assume 24576 == #t~mem50;havoc #t~mem50; {220394#false} is VALID [2022-04-15 11:52:45,816 INFO L290 TraceCheckUtils]: 59: Hoare triple {220394#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,816 INFO L290 TraceCheckUtils]: 60: Hoare triple {220394#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {220394#false} is VALID [2022-04-15 11:52:45,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {220394#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 62: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 63: Hoare triple {220394#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 66: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 67: Hoare triple {220394#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {220394#false} ~skip~0 := 0; {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 70: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 71: Hoare triple {220394#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {220394#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {220394#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {220394#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {220394#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {220394#false} assume 8480 == #t~mem52;havoc #t~mem52; {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {220394#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; {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 80: Hoare triple {220394#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {220394#false} ~skip~0 := 0; {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 82: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 83: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 84: Hoare triple {220394#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {220394#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {220394#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 87: Hoare triple {220394#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 88: Hoare triple {220394#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 89: Hoare triple {220394#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 90: Hoare triple {220394#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 91: Hoare triple {220394#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,818 INFO L290 TraceCheckUtils]: 92: Hoare triple {220394#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 93: Hoare triple {220394#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 94: Hoare triple {220394#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 95: Hoare triple {220394#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 96: Hoare triple {220394#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 97: Hoare triple {220394#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 98: Hoare triple {220394#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 99: Hoare triple {220394#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 100: Hoare triple {220394#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 101: Hoare triple {220394#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 102: Hoare triple {220394#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 103: Hoare triple {220394#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 104: Hoare triple {220394#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 105: Hoare triple {220394#false} assume 8448 == #t~mem68;havoc #t~mem68; {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 106: Hoare triple {220394#false} assume !(~num1~0 > 0); {220394#false} is VALID [2022-04-15 11:52:45,819 INFO L290 TraceCheckUtils]: 107: Hoare triple {220394#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; {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 108: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 109: Hoare triple {220394#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 110: Hoare triple {220394#false} ~skip~0 := 0; {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 111: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 112: Hoare triple {220394#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); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 113: Hoare triple {220394#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 114: Hoare triple {220394#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 115: Hoare triple {220394#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 116: Hoare triple {220394#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 117: Hoare triple {220394#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 118: Hoare triple {220394#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 119: Hoare triple {220394#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 120: Hoare triple {220394#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 121: Hoare triple {220394#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,820 INFO L290 TraceCheckUtils]: 122: Hoare triple {220394#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 123: Hoare triple {220394#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 124: Hoare triple {220394#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 125: Hoare triple {220394#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 126: Hoare triple {220394#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 127: Hoare triple {220394#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 128: Hoare triple {220394#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 129: Hoare triple {220394#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 130: Hoare triple {220394#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 131: Hoare triple {220394#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 132: Hoare triple {220394#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 133: Hoare triple {220394#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 134: Hoare triple {220394#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 135: Hoare triple {220394#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 136: Hoare triple {220394#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,821 INFO L290 TraceCheckUtils]: 137: Hoare triple {220394#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 138: Hoare triple {220394#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 139: Hoare triple {220394#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 140: Hoare triple {220394#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 141: Hoare triple {220394#false} assume 8640 == #t~mem75;havoc #t~mem75; {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 142: Hoare triple {220394#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 143: Hoare triple {220394#false} assume !(9 == ~blastFlag~0); {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 144: Hoare triple {220394#false} assume 12 == ~blastFlag~0; {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L290 TraceCheckUtils]: 145: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-15 11:52:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:52:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:45,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167328686] [2022-04-15 11:52:45,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167328686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:45,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:45,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:45,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:45,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621085083] [2022-04-15 11:52:45,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621085083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:45,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:45,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:45,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418543743] [2022-04-15 11:52:45,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 11:52:45,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:45,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:45,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:45,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:45,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:45,887 INFO L87 Difference]: Start difference. First operand 1359 states and 2122 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:49,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:51,785 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-15 11:52:53,845 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-15 11:52:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:58,567 INFO L93 Difference]: Finished difference Result 2398 states and 3719 transitions. [2022-04-15 11:52:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 11:52:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-04-15 11:52:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-04-15 11:52:58,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 550 transitions. [2022-04-15 11:52:58,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:58,966 INFO L225 Difference]: With dead ends: 2398 [2022-04-15 11:52:58,966 INFO L226 Difference]: Without dead ends: 1474 [2022-04-15 11:52:58,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:58,967 INFO L913 BasicCegarLoop]: 271 mSDtfsCounter, 93 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:58,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 661 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 593 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-04-15 11:52:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-04-15 11:52:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1359. [2022-04-15 11:52:59,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:59,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1474 states. Second operand has 1359 states, 1354 states have (on average 1.5620384047267355) internal successors, (2115), 1354 states have internal predecessors, (2115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:59,071 INFO L74 IsIncluded]: Start isIncluded. First operand 1474 states. Second operand has 1359 states, 1354 states have (on average 1.5620384047267355) internal successors, (2115), 1354 states have internal predecessors, (2115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:59,071 INFO L87 Difference]: Start difference. First operand 1474 states. Second operand has 1359 states, 1354 states have (on average 1.5620384047267355) internal successors, (2115), 1354 states have internal predecessors, (2115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:59,121 INFO L93 Difference]: Finished difference Result 1474 states and 2273 transitions. [2022-04-15 11:52:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2273 transitions. [2022-04-15 11:52:59,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:59,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:59,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 1359 states, 1354 states have (on average 1.5620384047267355) internal successors, (2115), 1354 states have internal predecessors, (2115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1474 states. [2022-04-15 11:52:59,124 INFO L87 Difference]: Start difference. First operand has 1359 states, 1354 states have (on average 1.5620384047267355) internal successors, (2115), 1354 states have internal predecessors, (2115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1474 states. [2022-04-15 11:52:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:59,173 INFO L93 Difference]: Finished difference Result 1474 states and 2273 transitions. [2022-04-15 11:52:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2273 transitions. [2022-04-15 11:52:59,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:59,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:59,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:59,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1354 states have (on average 1.5620384047267355) internal successors, (2115), 1354 states have internal predecessors, (2115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2119 transitions. [2022-04-15 11:52:59,241 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2119 transitions. Word has length 146 [2022-04-15 11:52:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:59,241 INFO L478 AbstractCegarLoop]: Abstraction has 1359 states and 2119 transitions. [2022-04-15 11:52:59,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:59,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2119 transitions. [2022-04-15 11:53:03,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2119 edges. 2118 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2119 transitions. [2022-04-15 11:53:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 11:53:03,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:03,643 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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-15 11:53:03,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 11:53:03,643 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2138187216, now seen corresponding path program 1 times [2022-04-15 11:53:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:03,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1439611006] [2022-04-15 11:53:03,714 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:03,714 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:03,714 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2138187216, now seen corresponding path program 2 times [2022-04-15 11:53:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:03,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437853751] [2022-04-15 11:53:03,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:03,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {230874#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {230867#true} is VALID [2022-04-15 11:53:03,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {230867#true} assume true; {230867#true} is VALID [2022-04-15 11:53:03,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {230867#true} {230867#true} #710#return; {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {230867#true} call ULTIMATE.init(); {230874#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:53:03,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {230874#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {230867#true} assume true; {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230867#true} {230867#true} #710#return; {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {230867#true} call #t~ret161 := main(); {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {230867#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; {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {230867#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L272 TraceCheckUtils]: 7: Hoare triple {230867#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {230867#true} is VALID [2022-04-15 11:53:03,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {230867#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); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {230867#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; {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {230867#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; {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {230867#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {230867#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {230867#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {230867#true} assume !false; {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {230867#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); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {230867#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {230867#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {230867#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {230867#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {230867#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {230867#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {230867#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {230867#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {230867#true} assume 8464 == #t~mem55;havoc #t~mem55; {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {230867#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; {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {230867#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {230867#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); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {230867#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); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {230867#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {230867#true} ~skip~0 := 0; {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {230867#true} assume !false; {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {230867#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); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {230867#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {230867#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {230867#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {230867#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {230867#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {230867#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {230867#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {230867#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {230867#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {230867#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {230867#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {230867#true} assume 8496 == #t~mem58;havoc #t~mem58; {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {230867#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {230867#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {230867#true} is VALID [2022-04-15 11:53:03,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {230867#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {230867#true} is VALID [2022-04-15 11:53:03,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {230867#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {230872#(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); {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {230872#(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; {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {230872#(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); {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {230872#(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); {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {230872#(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); {230872#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:03,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {230872#(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); {230873#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-15 11:53:03,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {230873#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {230868#false} is VALID [2022-04-15 11:53:03,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {230868#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {230868#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {230868#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 62: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 63: Hoare triple {230868#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 66: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 67: Hoare triple {230868#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 68: Hoare triple {230868#false} ~skip~0 := 0; {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 69: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {230868#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 72: Hoare triple {230868#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 73: Hoare triple {230868#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 74: Hoare triple {230868#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {230868#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 76: Hoare triple {230868#false} assume 8480 == #t~mem52;havoc #t~mem52; {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 77: Hoare triple {230868#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; {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 78: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 79: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 80: Hoare triple {230868#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 81: Hoare triple {230868#false} ~skip~0 := 0; {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 82: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 83: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 84: Hoare triple {230868#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {230868#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 86: Hoare triple {230868#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {230868#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {230868#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {230868#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {230868#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 91: Hoare triple {230868#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 92: Hoare triple {230868#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {230868#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {230868#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {230868#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {230868#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {230868#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {230868#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {230868#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {230868#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 101: Hoare triple {230868#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 102: Hoare triple {230868#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 103: Hoare triple {230868#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,889 INFO L290 TraceCheckUtils]: 104: Hoare triple {230868#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {230868#false} assume 8448 == #t~mem68;havoc #t~mem68; {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {230868#false} assume !(~num1~0 > 0); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 107: Hoare triple {230868#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; {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 108: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 109: Hoare triple {230868#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 110: Hoare triple {230868#false} ~skip~0 := 0; {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 111: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 112: Hoare triple {230868#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); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 113: Hoare triple {230868#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 114: Hoare triple {230868#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 115: Hoare triple {230868#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 116: Hoare triple {230868#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 117: Hoare triple {230868#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 118: Hoare triple {230868#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 119: Hoare triple {230868#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,890 INFO L290 TraceCheckUtils]: 120: Hoare triple {230868#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 121: Hoare triple {230868#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 122: Hoare triple {230868#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 123: Hoare triple {230868#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 124: Hoare triple {230868#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 125: Hoare triple {230868#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 126: Hoare triple {230868#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 127: Hoare triple {230868#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 128: Hoare triple {230868#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 129: Hoare triple {230868#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 130: Hoare triple {230868#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 131: Hoare triple {230868#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 132: Hoare triple {230868#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 133: Hoare triple {230868#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 134: Hoare triple {230868#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,891 INFO L290 TraceCheckUtils]: 135: Hoare triple {230868#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 136: Hoare triple {230868#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 137: Hoare triple {230868#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 138: Hoare triple {230868#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 139: Hoare triple {230868#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 140: Hoare triple {230868#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 141: Hoare triple {230868#false} assume 8640 == #t~mem75;havoc #t~mem75; {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 142: Hoare triple {230868#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 143: Hoare triple {230868#false} assume !(9 == ~blastFlag~0); {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 144: Hoare triple {230868#false} assume 12 == ~blastFlag~0; {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L290 TraceCheckUtils]: 145: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-15 11:53:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:53:03,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:03,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437853751] [2022-04-15 11:53:03,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437853751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:03,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:03,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:03,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:03,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1439611006] [2022-04-15 11:53:03,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1439611006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:03,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:03,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19280807] [2022-04-15 11:53:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:03,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 11:53:03,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:03,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:03,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:03,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:03,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:03,980 INFO L87 Difference]: Start difference. First operand 1359 states and 2119 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:06,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:53:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:09,801 INFO L93 Difference]: Finished difference Result 2494 states and 3842 transitions. [2022-04-15 11:53:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:09,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2022-04-15 11:53:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-15 11:53:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-15 11:53:09,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 605 transitions. [2022-04-15 11:53:10,192 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-15 11:53:10,284 INFO L225 Difference]: With dead ends: 2494 [2022-04-15 11:53:10,284 INFO L226 Difference]: Without dead ends: 1570 [2022-04-15 11:53:10,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:53:10,286 INFO L913 BasicCegarLoop]: 135 mSDtfsCounter, 147 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:10,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 384 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:53:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-04-15 11:53:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1359. [2022-04-15 11:53:10,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:10,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1570 states. Second operand has 1359 states, 1354 states have (on average 1.5443131462333826) internal successors, (2091), 1354 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-15 11:53:10,387 INFO L74 IsIncluded]: Start isIncluded. First operand 1570 states. Second operand has 1359 states, 1354 states have (on average 1.5443131462333826) internal successors, (2091), 1354 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-15 11:53:10,387 INFO L87 Difference]: Start difference. First operand 1570 states. Second operand has 1359 states, 1354 states have (on average 1.5443131462333826) internal successors, (2091), 1354 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-15 11:53:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:10,449 INFO L93 Difference]: Finished difference Result 1570 states and 2377 transitions. [2022-04-15 11:53:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2377 transitions. [2022-04-15 11:53:10,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:10,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:10,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 1359 states, 1354 states have (on average 1.5443131462333826) internal successors, (2091), 1354 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 1570 states. [2022-04-15 11:53:10,461 INFO L87 Difference]: Start difference. First operand has 1359 states, 1354 states have (on average 1.5443131462333826) internal successors, (2091), 1354 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 1570 states. [2022-04-15 11:53:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:10,523 INFO L93 Difference]: Finished difference Result 1570 states and 2377 transitions. [2022-04-15 11:53:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2377 transitions. [2022-04-15 11:53:10,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:10,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:10,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:10,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1354 states have (on average 1.5443131462333826) internal successors, (2091), 1354 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-15 11:53:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2095 transitions. [2022-04-15 11:53:10,592 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2095 transitions. Word has length 146 [2022-04-15 11:53:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:10,592 INFO L478 AbstractCegarLoop]: Abstraction has 1359 states and 2095 transitions. [2022-04-15 11:53:10,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:10,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2095 transitions. [2022-04-15 11:53:15,090 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-15 11:53:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2095 transitions. [2022-04-15 11:53:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:53:15,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:15,092 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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-15 11:53:15,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 11:53:15,092 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1315650067, now seen corresponding path program 1 times [2022-04-15 11:53:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:15,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947930216] [2022-04-15 11:53:15,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:53:15,392 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:15,392 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:15,393 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 11:53:15,396 INFO L158 Benchmark]: Toolchain (without parser) took 551422.97ms. Allocated memory was 202.4MB in the beginning and 394.3MB in the end (delta: 191.9MB). Free memory was 146.9MB in the beginning and 211.1MB in the end (delta: -64.2MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. [2022-04-15 11:53:15,396 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory was 165.6MB in the beginning and 165.4MB in the end (delta: 163.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:53:15,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.44ms. Allocated memory was 202.4MB in the beginning and 328.2MB in the end (delta: 125.8MB). Free memory was 146.7MB in the beginning and 277.6MB in the end (delta: -130.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 11:53:15,396 INFO L158 Benchmark]: Boogie Preprocessor took 74.50ms. Allocated memory is still 328.2MB. Free memory was 277.6MB in the beginning and 267.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 11:53:15,397 INFO L158 Benchmark]: RCFGBuilder took 1445.77ms. Allocated memory is still 328.2MB. Free memory was 267.7MB in the beginning and 238.8MB in the end (delta: 28.9MB). Peak memory consumption was 39.3MB. Max. memory is 8.0GB. [2022-04-15 11:53:15,397 INFO L158 Benchmark]: TraceAbstraction took 549467.21ms. Allocated memory was 328.2MB in the beginning and 394.3MB in the end (delta: 66.1MB). Free memory was 238.3MB in the beginning and 211.1MB in the end (delta: 27.2MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. [2022-04-15 11:53:15,397 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory was 165.6MB in the beginning and 165.4MB in the end (delta: 163.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.44ms. Allocated memory was 202.4MB in the beginning and 328.2MB in the end (delta: 125.8MB). Free memory was 146.7MB in the beginning and 277.6MB in the end (delta: -130.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.50ms. Allocated memory is still 328.2MB. Free memory was 277.6MB in the beginning and 267.7MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1445.77ms. Allocated memory is still 328.2MB. Free memory was 267.7MB in the beginning and 238.8MB in the end (delta: 28.9MB). Peak memory consumption was 39.3MB. Max. memory is 8.0GB. * TraceAbstraction took 549467.21ms. Allocated memory was 328.2MB in the beginning and 394.3MB in the end (delta: 66.1MB). Free memory was 238.3MB in the beginning and 211.1MB in the end (delta: 27.2MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 11:53:15,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...