/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-fb4f59a-m [2022-04-28 08:43:37,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:43:37,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:43:37,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:43:37,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:43:37,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:43:37,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:43:37,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:43:37,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:43:37,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:43:37,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:43:37,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:43:37,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:43:37,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:43:37,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:43:37,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:43:37,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:43:37,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:43:37,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:43:37,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:43:37,969 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:43:37,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:43:37,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:43:37,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:43:37,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:43:37,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:43:37,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:43:37,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:43:37,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:43:37,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:43:37,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:43:37,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:43:37,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:43:37,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:43:37,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:43:37,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:43:37,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:43:37,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:43:37,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:43:37,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:43:37,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:43:37,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:43:37,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:43:37,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:43:37,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:43:37,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:43:37,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:43:37,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:43:37,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:43:37,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:43:37,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:43:37,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:43:37,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:43:37,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:43:37,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:43:37,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:43:37,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:43:37,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:43:37,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:43:37,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:43:37,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:43:37,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:43:37,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:43:37,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:43:37,999 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:43:37,999 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:43:37,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:43:37,999 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:43:38,000 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:43:38,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:43:38,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:43:38,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:43:38,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:43:38,186 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:43:38,186 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-28 08:43:38,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043385003/61e4e1d2aa604553b1a5dd241df040bc/FLAGacf355a47 [2022-04-28 08:43:38,646 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:43:38,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.12.i.cil-2.c [2022-04-28 08:43:38,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043385003/61e4e1d2aa604553b1a5dd241df040bc/FLAGacf355a47 [2022-04-28 08:43:38,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043385003/61e4e1d2aa604553b1a5dd241df040bc [2022-04-28 08:43:38,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:43:38,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:43:38,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:43:38,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:43:38,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:43:38,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:43:38" (1/1) ... [2022-04-28 08:43:38,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2471e73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:38, skipping insertion in model container [2022-04-28 08:43:38,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:43:38" (1/1) ... [2022-04-28 08:43:38,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:43:38,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:43:39,004 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-28 08:43:39,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:43:39,024 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:43:39,106 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-28 08:43:39,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:43:39,129 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:43:39,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39 WrapperNode [2022-04-28 08:43:39,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:43:39,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:43:39,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:43:39,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:43:39,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:43:39,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:43:39,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:43:39,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:43:39,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (1/1) ... [2022-04-28 08:43:39,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:43:39,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:43:39,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:43:39,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:43:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:43:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:43:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:43:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 08:43:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 08:43:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:43:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:43:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:43:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:43:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:43:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:43:39,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:43:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:43:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:43:39,446 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:43:39,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:43:40,128 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:43:40,557 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 08:43:40,558 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 08:43:40,566 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:43:40,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:43:40,575 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:43:40,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:43:40 BoogieIcfgContainer [2022-04-28 08:43:40,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:43:40,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:43:40,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:43:40,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:43:40,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:43:38" (1/3) ... [2022-04-28 08:43:40,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797d2943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:43:40, skipping insertion in model container [2022-04-28 08:43:40,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:43:39" (2/3) ... [2022-04-28 08:43:40,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797d2943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:43:40, skipping insertion in model container [2022-04-28 08:43:40,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:43:40" (3/3) ... [2022-04-28 08:43:40,583 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2022-04-28 08:43:40,594 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:43:40,594 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:43:40,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:43:40,644 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43a4b2a7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fb11623 [2022-04-28 08:43:40,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:43:40,654 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-28 08:43:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 08:43:40,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:40,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:43:40,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1074581461, now seen corresponding path program 1 times [2022-04-28 08:43:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:40,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470003036] [2022-04-28 08:43:40,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:43:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1074581461, now seen corresponding path program 2 times [2022-04-28 08:43:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:43:40,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600386022] [2022-04-28 08:43:40,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:43:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:43:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:43:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:41,163 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-28 08:43:41,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-28 08:43:41,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164#true} {164#true} #710#return; {164#true} is VALID [2022-04-28 08:43:41,165 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-28 08:43:41,165 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-28 08:43:41,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-28 08:43:41,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} #710#return; {164#true} is VALID [2022-04-28 08:43:41,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} call #t~ret161 := main(); {164#true} is VALID [2022-04-28 08:43:41,166 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-28 08:43:41,166 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-28 08:43:41,166 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-28 08:43:41,168 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-28 08:43:41,173 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-28 08:43:41,174 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-28 08:43:41,175 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-28 08:43:41,175 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-28 08:43:41,176 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-28 08:43:41,176 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-28 08:43:41,178 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-28 08:43:41,178 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-28 08:43:41,179 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-28 08:43:41,179 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-28 08:43:41,180 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-28 08:43:41,180 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-28 08:43:41,181 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-28 08:43:41,182 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-28 08:43:41,182 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-28 08:43:41,183 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-28 08:43:41,183 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-28 08:43:41,185 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-28 08:43:41,185 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-28 08:43:41,186 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-28 08:43:41,186 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-28 08:43:41,187 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-28 08:43:41,188 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-28 08:43:41,188 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-28 08:43:41,189 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-28 08:43:41,189 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-28 08:43:41,190 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-28 08:43:41,191 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-28 08:43:41,191 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-28 08:43:41,191 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-28 08:43:41,192 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-28 08:43:41,193 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-28 08:43:41,193 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-28 08:43:41,194 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-28 08:43:41,194 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-28 08:43:41,195 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-28 08:43:41,195 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-28 08:43:41,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#false} assume !(9 == ~blastFlag~0); {165#false} is VALID [2022-04-28 08:43:41,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#false} assume 12 == ~blastFlag~0; {165#false} is VALID [2022-04-28 08:43:41,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-04-28 08:43:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:43:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:43:41,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600386022] [2022-04-28 08:43:41,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600386022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:41,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:41,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:41,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:43:41,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470003036] [2022-04-28 08:43:41,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470003036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:41,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:41,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737789382] [2022-04-28 08:43:41,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:43:41,214 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-28 08:43:41,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:43:41,218 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-28 08:43:41,281 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-28 08:43:41,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:43:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:43:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:43:41,311 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-28 08:43:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:45,076 INFO L93 Difference]: Finished difference Result 440 states and 746 transitions. [2022-04-28 08:43:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:43:45,077 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-28 08:43:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:43:45,078 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-28 08:43:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2022-04-28 08:43:45,098 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-28 08:43:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2022-04-28 08:43:45,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 746 transitions. [2022-04-28 08:43:45,619 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-28 08:43:45,631 INFO L225 Difference]: With dead ends: 440 [2022-04-28 08:43:45,632 INFO L226 Difference]: Without dead ends: 268 [2022-04-28 08:43:45,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:43:45,636 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 162 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:43:45,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 481 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 08:43:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-28 08:43:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 185. [2022-04-28 08:43:45,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:43:45,694 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-28 08:43:45,695 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-28 08:43:45,696 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-28 08:43:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:45,705 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2022-04-28 08:43:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-04-28 08:43:45,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:45,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:45,707 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-28 08:43:45,707 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-28 08:43:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:45,716 INFO L93 Difference]: Finished difference Result 268 states and 413 transitions. [2022-04-28 08:43:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-04-28 08:43:45,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:45,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:45,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:43:45,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:43:45,717 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-28 08:43:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 294 transitions. [2022-04-28 08:43:45,724 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 294 transitions. Word has length 49 [2022-04-28 08:43:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:43:45,724 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 294 transitions. [2022-04-28 08:43:45,724 INFO L496 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-28 08:43:45,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 294 transitions. [2022-04-28 08:43:45,917 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-28 08:43:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 294 transitions. [2022-04-28 08:43:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 08:43:45,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:45,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:43:45,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:43:45,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1287983627, now seen corresponding path program 1 times [2022-04-28 08:43:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1639234391] [2022-04-28 08:43:45,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:43:45,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1287983627, now seen corresponding path program 2 times [2022-04-28 08:43:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:43:45,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932337619] [2022-04-28 08:43:45,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:43:45,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:43:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:43:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:46,091 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-28 08:43:46,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1962#true} assume true; {1962#true} is VALID [2022-04-28 08:43:46,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1962#true} {1962#true} #710#return; {1962#true} is VALID [2022-04-28 08:43:46,093 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-28 08:43:46,094 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-28 08:43:46,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {1962#true} assume true; {1962#true} is VALID [2022-04-28 08:43:46,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1962#true} {1962#true} #710#return; {1962#true} is VALID [2022-04-28 08:43:46,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {1962#true} call #t~ret161 := main(); {1962#true} is VALID [2022-04-28 08:43:46,095 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-28 08:43:46,095 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-28 08:43:46,095 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-28 08:43:46,097 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-28 08:43:46,097 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-28 08:43:46,098 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-28 08:43:46,098 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-28 08:43:46,099 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-28 08:43:46,099 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-28 08:43:46,100 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-28 08:43:46,100 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-28 08:43:46,100 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-28 08:43:46,101 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-28 08:43:46,101 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-28 08:43:46,102 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-28 08:43:46,102 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-28 08:43:46,102 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-28 08:43:46,103 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-28 08:43:46,103 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-28 08:43:46,103 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-28 08:43:46,104 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-28 08:43:46,104 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-28 08:43:46,104 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-28 08:43:46,104 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-28 08:43:46,104 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-28 08:43:46,104 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-28 08:43:46,104 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-28 08:43:46,104 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-28 08:43:46,105 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-28 08:43:46,105 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-28 08:43:46,105 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-28 08:43:46,105 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-28 08:43:46,105 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-28 08:43:46,105 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-28 08:43:46,105 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-28 08:43:46,105 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-28 08:43:46,106 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-28 08:43:46,109 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-28 08:43:46,109 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-28 08:43:46,110 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-28 08:43:46,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {1963#false} assume 8641 == #t~mem76;havoc #t~mem76; {1963#false} is VALID [2022-04-28 08:43:46,110 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-28 08:43:46,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {1963#false} assume !(9 == ~blastFlag~0); {1963#false} is VALID [2022-04-28 08:43:46,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {1963#false} assume 12 == ~blastFlag~0; {1963#false} is VALID [2022-04-28 08:43:46,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {1963#false} assume !false; {1963#false} is VALID [2022-04-28 08:43:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:43:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:43:46,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932337619] [2022-04-28 08:43:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932337619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:46,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:46,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:46,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:43:46,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1639234391] [2022-04-28 08:43:46,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1639234391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:46,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:46,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74537877] [2022-04-28 08:43:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:43:46,115 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-28 08:43:46,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:43:46,115 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-28 08:43:46,147 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-28 08:43:46,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:43:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:43:46,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:43:46,149 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-28 08:43:48,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:43:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:54,978 INFO L93 Difference]: Finished difference Result 383 states and 610 transitions. [2022-04-28 08:43:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:43:54,978 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-28 08:43:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:43:54,979 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-28 08:43:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-28 08:43:54,983 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-28 08:43:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-28 08:43:54,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-28 08:43:55,292 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-28 08:43:55,298 INFO L225 Difference]: With dead ends: 383 [2022-04-28 08:43:55,298 INFO L226 Difference]: Without dead ends: 213 [2022-04-28 08:43:55,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:43:55,301 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:43:55,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 499 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 08:43:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-28 08:43:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-04-28 08:43:55,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:43:55,317 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-28 08:43:55,317 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-28 08:43:55,318 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-28 08:43:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:55,323 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2022-04-28 08:43:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-28 08:43:55,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:55,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:55,324 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-28 08:43:55,324 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-28 08:43:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:43:55,329 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2022-04-28 08:43:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2022-04-28 08:43:55,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:43:55,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:43:55,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:43:55,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:43:55,330 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-28 08:43:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 313 transitions. [2022-04-28 08:43:55,335 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 313 transitions. Word has length 50 [2022-04-28 08:43:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:43:55,336 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 313 transitions. [2022-04-28 08:43:55,336 INFO L496 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-28 08:43:55,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 313 transitions. [2022-04-28 08:43:55,649 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-28 08:43:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 313 transitions. [2022-04-28 08:43:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 08:43:55,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:43:55,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:43:55,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:43:55,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:43:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:43:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash 41561780, now seen corresponding path program 1 times [2022-04-28 08:43:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:55,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206602504] [2022-04-28 08:43:55,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:43:55,702 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:43:55,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:43:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 41561780, now seen corresponding path program 2 times [2022-04-28 08:43:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:43:55,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068801871] [2022-04-28 08:43:55,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:43:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:43:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:43:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:43:55,861 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-28 08:43:55,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 08:43:55,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3558#true} {3558#true} #710#return; {3558#true} is VALID [2022-04-28 08:43:55,862 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-28 08:43:55,863 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-28 08:43:55,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#true} assume true; {3558#true} is VALID [2022-04-28 08:43:55,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3558#true} {3558#true} #710#return; {3558#true} is VALID [2022-04-28 08:43:55,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {3558#true} call #t~ret161 := main(); {3558#true} is VALID [2022-04-28 08:43:55,864 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-28 08:43:55,865 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-28 08:43:55,865 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-28 08:43:55,867 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-28 08:43:55,868 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-28 08:43:55,868 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-28 08:43:55,875 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-28 08:43:55,875 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-28 08:43:55,876 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-28 08:43:55,876 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-28 08:43:55,876 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-28 08:43:55,877 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-28 08:43:55,877 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-28 08:43:55,877 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-28 08:43:55,878 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-28 08:43:55,878 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-28 08:43:55,879 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-28 08:43:55,879 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-28 08:43:55,879 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-28 08:43:55,879 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-28 08:43:55,879 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-28 08:43:55,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {3559#false} ~skip~0 := 0; {3559#false} is VALID [2022-04-28 08:43:55,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-28 08:43:55,879 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-28 08:43:55,880 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-28 08:43:55,880 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-28 08:43:55,880 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-28 08:43:55,880 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-28 08:43:55,880 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-28 08:43:55,880 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-28 08:43:55,880 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-28 08:43:55,880 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,881 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,882 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-28 08:43:55,883 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-28 08:43:55,883 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-28 08:43:55,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {3559#false} assume 8641 == #t~mem76;havoc #t~mem76; {3559#false} is VALID [2022-04-28 08:43:55,883 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-28 08:43:55,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {3559#false} assume !(9 == ~blastFlag~0); {3559#false} is VALID [2022-04-28 08:43:55,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {3559#false} assume 12 == ~blastFlag~0; {3559#false} is VALID [2022-04-28 08:43:55,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {3559#false} assume !false; {3559#false} is VALID [2022-04-28 08:43:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:43:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:43:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068801871] [2022-04-28 08:43:55,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068801871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:55,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:55,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:55,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:43:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206602504] [2022-04-28 08:43:55,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206602504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:43:55,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:43:55,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:43:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325021217] [2022-04-28 08:43:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:43:55,885 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-28 08:43:55,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:43:55,886 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-28 08:43:55,928 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-28 08:43:55,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:43:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:43:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:43:55,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:43:55,929 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-28 08:44:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:01,970 INFO L93 Difference]: Finished difference Result 383 states and 609 transitions. [2022-04-28 08:44:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:44:01,970 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-28 08:44:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:44:01,971 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-28 08:44:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 08:44:01,974 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-28 08:44:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-28 08:44:01,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-28 08:44:02,255 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-28 08:44:02,259 INFO L225 Difference]: With dead ends: 383 [2022-04-28 08:44:02,259 INFO L226 Difference]: Without dead ends: 213 [2022-04-28 08:44:02,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:44:02,260 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 24 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:44:02,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 501 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 08:44:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-28 08:44:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-04-28 08:44:02,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:44:02,268 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-28 08:44:02,268 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-28 08:44:02,268 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-28 08:44:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:02,273 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2022-04-28 08:44:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-28 08:44:02,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:02,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:02,273 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-28 08:44:02,274 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-28 08:44:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:02,278 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2022-04-28 08:44:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2022-04-28 08:44:02,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:02,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:02,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:44:02,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:44:02,279 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-28 08:44:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 312 transitions. [2022-04-28 08:44:02,284 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 312 transitions. Word has length 63 [2022-04-28 08:44:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:44:02,284 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 312 transitions. [2022-04-28 08:44:02,284 INFO L496 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-28 08:44:02,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 312 transitions. [2022-04-28 08:44:02,478 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-28 08:44:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 312 transitions. [2022-04-28 08:44:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:44:02,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:44:02,479 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:44:02,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:44:02,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:44:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:44:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash -674118940, now seen corresponding path program 1 times [2022-04-28 08:44:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:02,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792841891] [2022-04-28 08:44:02,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:44:02,499 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:44:02,499 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:44:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash -674118940, now seen corresponding path program 2 times [2022-04-28 08:44:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:02,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064281453] [2022-04-28 08:44:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:02,638 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-28 08:44:02,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {5154#true} assume true; {5154#true} is VALID [2022-04-28 08:44:02,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5154#true} {5154#true} #710#return; {5154#true} is VALID [2022-04-28 08:44:02,652 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-28 08:44:02,652 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-28 08:44:02,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {5154#true} assume true; {5154#true} is VALID [2022-04-28 08:44:02,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5154#true} {5154#true} #710#return; {5154#true} is VALID [2022-04-28 08:44:02,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {5154#true} call #t~ret161 := main(); {5154#true} is VALID [2022-04-28 08:44:02,652 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-28 08:44:02,653 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-28 08:44:02,653 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-28 08:44:02,654 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-28 08:44:02,655 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-28 08:44:02,655 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-28 08:44:02,656 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-28 08:44:02,656 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-28 08:44:02,657 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-28 08:44:02,657 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-28 08:44:02,657 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-28 08:44:02,658 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-28 08:44:02,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {5155#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5155#false} is VALID [2022-04-28 08:44:02,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {5155#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5155#false} is VALID [2022-04-28 08:44:02,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {5155#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5155#false} is VALID [2022-04-28 08:44:02,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {5155#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5155#false} is VALID [2022-04-28 08:44:02,658 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-28 08:44:02,658 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-28 08:44:02,659 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-28 08:44:02,659 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-28 08:44:02,659 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-28 08:44:02,659 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-28 08:44:02,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {5155#false} ~skip~0 := 0; {5155#false} is VALID [2022-04-28 08:44:02,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {5155#false} assume !false; {5155#false} is VALID [2022-04-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,663 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,664 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,665 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-28 08:44:02,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {5155#false} assume 8641 == #t~mem76;havoc #t~mem76; {5155#false} is VALID [2022-04-28 08:44:02,666 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-28 08:44:02,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {5155#false} assume !(9 == ~blastFlag~0); {5155#false} is VALID [2022-04-28 08:44:02,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {5155#false} assume 12 == ~blastFlag~0; {5155#false} is VALID [2022-04-28 08:44:02,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {5155#false} assume !false; {5155#false} is VALID [2022-04-28 08:44:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:44:02,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:02,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064281453] [2022-04-28 08:44:02,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064281453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:02,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:02,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:44:02,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:44:02,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792841891] [2022-04-28 08:44:02,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792841891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:02,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:02,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:44:02,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591355682] [2022-04-28 08:44:02,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:44:02,670 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-28 08:44:02,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:44:02,672 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-28 08:44:02,710 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-28 08:44:02,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:44:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:02,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:44:02,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:44:02,711 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-28 08:44:07,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:09,432 INFO L93 Difference]: Finished difference Result 382 states and 607 transitions. [2022-04-28 08:44:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:44:09,433 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-28 08:44:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:44:09,433 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-28 08:44:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 08:44:09,436 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-28 08:44:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 08:44:09,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-28 08:44:09,742 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-28 08:44:09,755 INFO L225 Difference]: With dead ends: 382 [2022-04-28 08:44:09,755 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 08:44:09,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:44:09,756 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 28 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:44:09,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 503 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 08:44:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 08:44:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 196. [2022-04-28 08:44:09,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:44:09,766 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-28 08:44:09,767 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-28 08:44:09,772 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-28 08:44:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:09,775 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-28 08:44:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-28 08:44:09,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:09,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:09,776 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-28 08:44:09,776 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-28 08:44:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:09,779 INFO L93 Difference]: Finished difference Result 212 states and 331 transitions. [2022-04-28 08:44:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2022-04-28 08:44:09,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:09,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:09,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:44:09,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:44:09,780 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-28 08:44:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 311 transitions. [2022-04-28 08:44:09,782 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 311 transitions. Word has length 64 [2022-04-28 08:44:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:44:09,782 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 311 transitions. [2022-04-28 08:44:09,783 INFO L496 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-28 08:44:09,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 311 transitions. [2022-04-28 08:44:09,966 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-28 08:44:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 311 transitions. [2022-04-28 08:44:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:44:09,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:44:09,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:44:09,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:44:09,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:44:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:44:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1212784504, now seen corresponding path program 1 times [2022-04-28 08:44:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:09,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318046550] [2022-04-28 08:44:10,126 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-28 08:44:10,127 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:44:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1121925032, now seen corresponding path program 1 times [2022-04-28 08:44:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:10,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308053497] [2022-04-28 08:44:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:10,256 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-28 08:44:10,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {6746#true} assume true; {6746#true} is VALID [2022-04-28 08:44:10,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6746#true} {6746#true} #710#return; {6746#true} is VALID [2022-04-28 08:44:10,257 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-28 08:44:10,261 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-28 08:44:10,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {6746#true} assume true; {6746#true} is VALID [2022-04-28 08:44:10,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6746#true} {6746#true} #710#return; {6746#true} is VALID [2022-04-28 08:44:10,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {6746#true} call #t~ret161 := main(); {6746#true} is VALID [2022-04-28 08:44:10,265 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-28 08:44:10,266 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-28 08:44:10,266 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-28 08:44:10,266 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-28 08:44:10,267 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-28 08:44:10,267 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-28 08:44:10,268 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-28 08:44:10,268 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-28 08:44:10,269 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-28 08:44:10,271 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-28 08:44:10,271 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-28 08:44:10,271 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-28 08:44:10,272 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-28 08:44:10,272 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-28 08:44:10,272 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-28 08:44:10,272 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-28 08:44:10,273 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-28 08:44:10,273 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-28 08:44:10,273 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-28 08:44:10,273 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-28 08:44:10,274 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-28 08:44:10,274 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-28 08:44:10,274 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-28 08:44:10,274 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-28 08:44:10,275 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-28 08:44:10,275 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-28 08:44:10,275 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-28 08:44:10,276 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-28 08:44:10,276 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-28 08:44:10,276 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-28 08:44:10,276 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-28 08:44:10,277 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-28 08:44:10,277 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-28 08:44:10,277 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-28 08:44:10,277 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-28 08:44:10,278 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-28 08:44:10,278 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-28 08:44:10,278 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-28 08:44:10,278 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-28 08:44:10,279 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-28 08:44:10,279 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-28 08:44:10,279 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-28 08:44:10,280 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-28 08:44:10,280 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-28 08:44:10,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {6751#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {6747#false} is VALID [2022-04-28 08:44:10,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {6747#false} assume !false; {6747#false} is VALID [2022-04-28 08:44:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:44:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308053497] [2022-04-28 08:44:10,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308053497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:10,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:10,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:44:13,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:44:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318046550] [2022-04-28 08:44:13,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318046550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:13,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:13,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 08:44:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24011501] [2022-04-28 08:44:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:44:13,028 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-28 08:44:13,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:44:13,028 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-28 08:44:13,091 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-28 08:44:13,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 08:44:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:13,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 08:44:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:44:13,092 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-28 08:44:16,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:19,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:21,560 INFO L93 Difference]: Finished difference Result 534 states and 861 transitions. [2022-04-28 08:44:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:44:21,560 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-28 08:44:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:44:21,561 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-28 08:44:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 625 transitions. [2022-04-28 08:44:21,564 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-28 08:44:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 625 transitions. [2022-04-28 08:44:21,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 625 transitions. [2022-04-28 08:44:22,015 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-28 08:44:22,021 INFO L225 Difference]: With dead ends: 534 [2022-04-28 08:44:22,021 INFO L226 Difference]: Without dead ends: 364 [2022-04-28 08:44:22,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:44:22,025 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 148 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:44:22,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 927 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 723 Invalid, 0 Unknown, 227 Unchecked, 3.8s Time] [2022-04-28 08:44:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-28 08:44:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 359. [2022-04-28 08:44:22,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:44:22,052 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-28 08:44:22,053 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-28 08:44:22,054 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-28 08:44:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:22,060 INFO L93 Difference]: Finished difference Result 364 states and 572 transitions. [2022-04-28 08:44:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 572 transitions. [2022-04-28 08:44:22,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:22,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:22,061 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-28 08:44:22,062 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-28 08:44:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:22,071 INFO L93 Difference]: Finished difference Result 364 states and 572 transitions. [2022-04-28 08:44:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 572 transitions. [2022-04-28 08:44:22,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:22,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:22,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:44:22,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:44:22,073 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-28 08:44:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 566 transitions. [2022-04-28 08:44:22,080 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 566 transitions. Word has length 64 [2022-04-28 08:44:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:44:22,080 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 566 transitions. [2022-04-28 08:44:22,080 INFO L496 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-28 08:44:22,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 566 transitions. [2022-04-28 08:44:22,461 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-28 08:44:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 566 transitions. [2022-04-28 08:44:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:44:22,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:44:22,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:44:22,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:44:22,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:44:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:44:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2106270842, now seen corresponding path program 1 times [2022-04-28 08:44:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:22,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573314966] [2022-04-28 08:44:22,584 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-28 08:44:22,585 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:44:22,585 INFO L85 PathProgramCache]: Analyzing trace with hash -856760296, now seen corresponding path program 1 times [2022-04-28 08:44:22,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:22,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542386744] [2022-04-28 08:44:22,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:22,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:22,678 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-28 08:44:22,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {9278#true} assume true; {9278#true} is VALID [2022-04-28 08:44:22,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9278#true} {9278#true} #710#return; {9278#true} is VALID [2022-04-28 08:44:22,679 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-28 08:44:22,679 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-28 08:44:22,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {9278#true} assume true; {9278#true} is VALID [2022-04-28 08:44:22,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9278#true} {9278#true} #710#return; {9278#true} is VALID [2022-04-28 08:44:22,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {9278#true} call #t~ret161 := main(); {9278#true} is VALID [2022-04-28 08:44:22,679 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-28 08:44:22,680 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-28 08:44:22,680 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-28 08:44:22,680 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-28 08:44:22,680 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-28 08:44:22,681 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-28 08:44:22,681 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-28 08:44:22,682 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-28 08:44:22,682 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-28 08:44:22,682 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-28 08:44:22,683 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-28 08:44:22,683 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-28 08:44:22,683 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-28 08:44:22,684 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-28 08:44:22,684 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-28 08:44:22,684 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-28 08:44:22,684 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-28 08:44:22,685 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-28 08:44:22,685 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-28 08:44:22,685 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-28 08:44:22,685 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-28 08:44:22,686 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-28 08:44:22,686 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-28 08:44:22,686 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-28 08:44:22,686 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-28 08:44:22,687 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-28 08:44:22,687 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-28 08:44:22,687 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-28 08:44:22,688 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-28 08:44:22,688 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-28 08:44:22,688 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-28 08:44:22,688 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-28 08:44:22,689 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-28 08:44:22,689 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-28 08:44:22,689 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-28 08:44:22,689 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-28 08:44:22,690 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-28 08:44:22,690 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-28 08:44:22,690 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-28 08:44:22,691 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-28 08:44:22,691 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-28 08:44:22,691 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-28 08:44:22,691 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-28 08:44:22,692 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-28 08:44:22,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {9283#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {9279#false} is VALID [2022-04-28 08:44:22,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {9279#false} assume !false; {9279#false} is VALID [2022-04-28 08:44:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:44:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:22,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542386744] [2022-04-28 08:44:22,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542386744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:22,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:22,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:44:25,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:44:25,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573314966] [2022-04-28 08:44:25,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573314966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:25,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:25,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 08:44:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433658423] [2022-04-28 08:44:25,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:44:25,534 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-28 08:44:25,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:44:25,534 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-28 08:44:25,593 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-28 08:44:25,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 08:44:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:25,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 08:44:25,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:44:25,594 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-28 08:44:28,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:31,833 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-28 08:44:35,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:37,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:41,312 INFO L93 Difference]: Finished difference Result 538 states and 853 transitions. [2022-04-28 08:44:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:44:41,312 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-28 08:44:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:44:41,313 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-28 08:44:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-28 08:44:41,316 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-28 08:44:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 612 transitions. [2022-04-28 08:44:41,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 612 transitions. [2022-04-28 08:44:41,719 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-28 08:44:41,725 INFO L225 Difference]: With dead ends: 538 [2022-04-28 08:44:41,725 INFO L226 Difference]: Without dead ends: 368 [2022-04-28 08:44:41,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:44:41,726 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 148 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:44:41,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 821 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 364 Unchecked, 8.2s Time] [2022-04-28 08:44:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-28 08:44:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 359. [2022-04-28 08:44:41,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:44:41,738 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-28 08:44:41,738 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-28 08:44:41,739 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-28 08:44:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:41,745 INFO L93 Difference]: Finished difference Result 368 states and 577 transitions. [2022-04-28 08:44:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 577 transitions. [2022-04-28 08:44:41,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:41,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:41,746 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-28 08:44:41,747 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-28 08:44:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:41,752 INFO L93 Difference]: Finished difference Result 368 states and 577 transitions. [2022-04-28 08:44:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 577 transitions. [2022-04-28 08:44:41,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:41,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:41,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:44:41,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:44:41,753 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-28 08:44:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 566 transitions. [2022-04-28 08:44:41,760 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 566 transitions. Word has length 64 [2022-04-28 08:44:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:44:41,760 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 566 transitions. [2022-04-28 08:44:41,760 INFO L496 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-28 08:44:41,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 359 states and 566 transitions. [2022-04-28 08:44:42,192 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-28 08:44:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 566 transitions. [2022-04-28 08:44:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:44:42,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:44:42,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:44:42,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:44:42,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:44:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:44:42,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1071065521, now seen corresponding path program 1 times [2022-04-28 08:44:42,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:42,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [974683157] [2022-04-28 08:44:42,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:44:42,212 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:44:42,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:44:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1071065521, now seen corresponding path program 2 times [2022-04-28 08:44:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:42,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101826897] [2022-04-28 08:44:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:42,353 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-28 08:44:42,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {11826#true} assume true; {11826#true} is VALID [2022-04-28 08:44:42,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11826#true} {11826#true} #710#return; {11826#true} is VALID [2022-04-28 08:44:42,354 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-28 08:44:42,354 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-28 08:44:42,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {11826#true} assume true; {11826#true} is VALID [2022-04-28 08:44:42,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11826#true} {11826#true} #710#return; {11826#true} is VALID [2022-04-28 08:44:42,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {11826#true} call #t~ret161 := main(); {11826#true} is VALID [2022-04-28 08:44:42,354 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-28 08:44:42,354 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-28 08:44:42,355 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-28 08:44:42,356 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-28 08:44:42,357 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-28 08:44:42,358 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-28 08:44:42,358 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-28 08:44:42,358 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-28 08:44:42,359 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-28 08:44:42,359 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-28 08:44:42,360 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-28 08:44:42,361 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-28 08:44:42,361 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-28 08:44:42,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {11827#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {11827#false} is VALID [2022-04-28 08:44:42,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {11827#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11827#false} is VALID [2022-04-28 08:44:42,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {11827#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {11827#false} is VALID [2022-04-28 08:44:42,362 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-28 08:44:42,363 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-28 08:44:42,363 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-28 08:44:42,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {11827#false} assume 12292 != #t~mem85;havoc #t~mem85; {11827#false} is VALID [2022-04-28 08:44:42,365 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-28 08:44:42,365 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-28 08:44:42,365 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-28 08:44:42,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {11827#false} ~skip~0 := 0; {11827#false} is VALID [2022-04-28 08:44:42,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {11827#false} assume !false; {11827#false} is VALID [2022-04-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,366 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,367 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-28 08:44:42,368 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-28 08:44:42,368 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-28 08:44:42,368 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-28 08:44:42,368 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-28 08:44:42,368 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-28 08:44:42,368 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-28 08:44:42,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {11827#false} assume 8641 == #t~mem76;havoc #t~mem76; {11827#false} is VALID [2022-04-28 08:44:42,368 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-28 08:44:42,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {11827#false} assume !(9 == ~blastFlag~0); {11827#false} is VALID [2022-04-28 08:44:42,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {11827#false} assume 12 == ~blastFlag~0; {11827#false} is VALID [2022-04-28 08:44:42,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {11827#false} assume !false; {11827#false} is VALID [2022-04-28 08:44:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:44:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:42,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101826897] [2022-04-28 08:44:42,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101826897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:42,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:42,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:44:42,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:44:42,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [974683157] [2022-04-28 08:44:42,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [974683157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:42,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:42,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:44:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652727568] [2022-04-28 08:44:42,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:44:42,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:44:42,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:44:42,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:42,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:44:42,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:44:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:44:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:44:42,424 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-28 08:44:50,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:44:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:51,620 INFO L93 Difference]: Finished difference Result 766 states and 1206 transitions. [2022-04-28 08:44:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:44:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:44:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:44:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-28 08:44:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-28 08:44:51,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-28 08:44:52,039 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-28 08:44:52,053 INFO L225 Difference]: With dead ends: 766 [2022-04-28 08:44:52,053 INFO L226 Difference]: Without dead ends: 589 [2022-04-28 08:44:52,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:44:52,054 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 157 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:44:52,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 362 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 08:44:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-04-28 08:44:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 383. [2022-04-28 08:44:52,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:44:52,067 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-28 08:44:52,068 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-28 08:44:52,068 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-28 08:44:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:52,080 INFO L93 Difference]: Finished difference Result 589 states and 917 transitions. [2022-04-28 08:44:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 917 transitions. [2022-04-28 08:44:52,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:52,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:52,081 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-28 08:44:52,082 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-28 08:44:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:44:52,093 INFO L93 Difference]: Finished difference Result 589 states and 917 transitions. [2022-04-28 08:44:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 917 transitions. [2022-04-28 08:44:52,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:44:52,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:44:52,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:44:52,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:44:52,095 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-28 08:44:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 599 transitions. [2022-04-28 08:44:52,102 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 599 transitions. Word has length 65 [2022-04-28 08:44:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:44:52,102 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 599 transitions. [2022-04-28 08:44:52,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:44:52,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 383 states and 599 transitions. [2022-04-28 08:44:52,569 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-28 08:44:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 599 transitions. [2022-04-28 08:44:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:44:52,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:44:52,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:44:52,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:44:52,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:44:52,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:44:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -615987875, now seen corresponding path program 1 times [2022-04-28 08:44:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:52,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754072219] [2022-04-28 08:44:52,706 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-28 08:44:52,707 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:44:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash -591595560, now seen corresponding path program 1 times [2022-04-28 08:44:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:44:52,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794166423] [2022-04-28 08:44:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:44:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:44:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:52,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:44:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:44:52,801 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-28 08:44:52,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {15314#true} assume true; {15314#true} is VALID [2022-04-28 08:44:52,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15314#true} {15314#true} #710#return; {15314#true} is VALID [2022-04-28 08:44:52,802 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-28 08:44:52,802 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-28 08:44:52,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {15314#true} assume true; {15314#true} is VALID [2022-04-28 08:44:52,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15314#true} {15314#true} #710#return; {15314#true} is VALID [2022-04-28 08:44:52,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {15314#true} call #t~ret161 := main(); {15314#true} is VALID [2022-04-28 08:44:52,802 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-28 08:44:52,803 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-28 08:44:52,803 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-28 08:44:52,803 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-28 08:44:52,804 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-28 08:44:52,804 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-28 08:44:52,804 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-28 08:44:52,804 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-28 08:44:52,805 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-28 08:44:52,805 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-28 08:44:52,805 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-28 08:44:52,805 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-28 08:44:52,806 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-28 08:44:52,806 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-28 08:44:52,806 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-28 08:44:52,806 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-28 08:44:52,807 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-28 08:44:52,807 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-28 08:44:52,807 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-28 08:44:52,807 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-28 08:44:52,808 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-28 08:44:52,808 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-28 08:44:52,808 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-28 08:44:52,808 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-28 08:44:52,809 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-28 08:44:52,809 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-28 08:44:52,809 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-28 08:44:52,809 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-28 08:44:52,810 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-28 08:44:52,810 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-28 08:44:52,810 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-28 08:44:52,810 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-28 08:44:52,811 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-28 08:44:52,811 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-28 08:44:52,811 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-28 08:44:52,811 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-28 08:44:52,812 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-28 08:44:52,812 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-28 08:44:52,812 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-28 08:44:52,812 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-28 08:44:52,813 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-28 08:44:52,813 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-28 08:44:52,813 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-28 08:44:52,813 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-28 08:44:52,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {15319#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {15315#false} is VALID [2022-04-28 08:44:52,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {15315#false} assume !false; {15315#false} is VALID [2022-04-28 08:44:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:44:52,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:44:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794166423] [2022-04-28 08:44:52,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794166423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:52,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:52,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:44:56,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:44:56,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754072219] [2022-04-28 08:44:56,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754072219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:44:56,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:44:56,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 08:44:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854430984] [2022-04-28 08:44:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:44:56,136 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-28 08:44:56,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:44:56,136 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-28 08:44:56,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:44:56,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 08:44:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:44:56,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 08:44:56,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:44:56,198 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-28 08:44:59,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:01,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:06,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:08,360 INFO L93 Difference]: Finished difference Result 577 states and 907 transitions. [2022-04-28 08:45:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 08:45:08,360 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-28 08:45:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:08,360 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-28 08:45:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 612 transitions. [2022-04-28 08:45:08,363 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-28 08:45:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 612 transitions. [2022-04-28 08:45:08,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 612 transitions. [2022-04-28 08:45:08,794 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-28 08:45:08,801 INFO L225 Difference]: With dead ends: 577 [2022-04-28 08:45:08,801 INFO L226 Difference]: Without dead ends: 395 [2022-04-28 08:45:08,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:45:08,802 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 145 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:08,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 809 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 786 Invalid, 3 Unknown, 150 Unchecked, 9.1s Time] [2022-04-28 08:45:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-28 08:45:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 385. [2022-04-28 08:45:08,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:08,817 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-28 08:45:08,817 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-28 08:45:08,818 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-28 08:45:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:08,824 INFO L93 Difference]: Finished difference Result 395 states and 614 transitions. [2022-04-28 08:45:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 614 transitions. [2022-04-28 08:45:08,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:08,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:08,826 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-28 08:45:08,827 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-28 08:45:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:08,834 INFO L93 Difference]: Finished difference Result 395 states and 614 transitions. [2022-04-28 08:45:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 614 transitions. [2022-04-28 08:45:08,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:08,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:08,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:08,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:08,835 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-28 08:45:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 602 transitions. [2022-04-28 08:45:08,842 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 602 transitions. Word has length 65 [2022-04-28 08:45:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:08,842 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 602 transitions. [2022-04-28 08:45:08,842 INFO L496 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-28 08:45:08,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 602 transitions. [2022-04-28 08:45:09,513 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-28 08:45:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 602 transitions. [2022-04-28 08:45:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:45:09,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:09,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:09,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:45:09,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash 277498463, now seen corresponding path program 1 times [2022-04-28 08:45:09,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:09,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390189993] [2022-04-28 08:45:09,640 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-28 08:45:09,641 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:45:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash -326430824, now seen corresponding path program 1 times [2022-04-28 08:45:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:09,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052093842] [2022-04-28 08:45:09,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:09,753 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-28 08:45:09,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {18047#true} assume true; {18047#true} is VALID [2022-04-28 08:45:09,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18047#true} {18047#true} #710#return; {18047#true} is VALID [2022-04-28 08:45:09,754 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-28 08:45:09,755 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-28 08:45:09,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {18047#true} assume true; {18047#true} is VALID [2022-04-28 08:45:09,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18047#true} {18047#true} #710#return; {18047#true} is VALID [2022-04-28 08:45:09,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {18047#true} call #t~ret161 := main(); {18047#true} is VALID [2022-04-28 08:45:09,755 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-28 08:45:09,755 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-28 08:45:09,755 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-28 08:45:09,755 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-28 08:45:09,756 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-28 08:45:09,756 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-28 08:45:09,756 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-28 08:45:09,756 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-28 08:45:09,757 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-28 08:45:09,757 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-28 08:45:09,757 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-28 08:45:09,758 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-28 08:45:09,758 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-28 08:45:09,758 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-28 08:45:09,758 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-28 08:45:09,759 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-28 08:45:09,759 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-28 08:45:09,759 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-28 08:45:09,759 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-28 08:45:09,760 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-28 08:45:09,760 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-28 08:45:09,760 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-28 08:45:09,761 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-28 08:45:09,761 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-28 08:45:09,761 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-28 08:45:09,761 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-28 08:45:09,762 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-28 08:45:09,762 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-28 08:45:09,762 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-28 08:45:09,762 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-28 08:45:09,763 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-28 08:45:09,763 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-28 08:45:09,763 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-28 08:45:09,763 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-28 08:45:09,764 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-28 08:45:09,764 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-28 08:45:09,764 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-28 08:45:09,765 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-28 08:45:09,765 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-28 08:45:09,765 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-28 08:45:09,765 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-28 08:45:09,766 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-28 08:45:09,766 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-28 08:45:09,766 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-28 08:45:09,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {18052#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {18048#false} is VALID [2022-04-28 08:45:09,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {18048#false} assume !false; {18048#false} is VALID [2022-04-28 08:45:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:09,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:09,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052093842] [2022-04-28 08:45:09,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052093842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:09,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:09,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:45:12,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:12,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390189993] [2022-04-28 08:45:12,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390189993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:12,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:12,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 08:45:12,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369536700] [2022-04-28 08:45:12,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:12,540 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-28 08:45:12,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:12,540 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-28 08:45:12,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:12,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 08:45:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 08:45:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:45:12,600 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-28 08:45:16,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:17,056 INFO L93 Difference]: Finished difference Result 578 states and 908 transitions. [2022-04-28 08:45:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 08:45:17,056 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-28 08:45:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:17,056 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-28 08:45:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 453 transitions. [2022-04-28 08:45:17,059 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-28 08:45:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 453 transitions. [2022-04-28 08:45:17,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 453 transitions. [2022-04-28 08:45:17,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:17,356 INFO L225 Difference]: With dead ends: 578 [2022-04-28 08:45:17,357 INFO L226 Difference]: Without dead ends: 396 [2022-04-28 08:45:17,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:45:17,357 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 9 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:17,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 469 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 1 Unknown, 154 Unchecked, 2.9s Time] [2022-04-28 08:45:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-28 08:45:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 385. [2022-04-28 08:45:17,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:17,380 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-28 08:45:17,381 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-28 08:45:17,382 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-28 08:45:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:17,388 INFO L93 Difference]: Finished difference Result 396 states and 615 transitions. [2022-04-28 08:45:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2022-04-28 08:45:17,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:17,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:17,389 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-28 08:45:17,389 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-28 08:45:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:17,395 INFO L93 Difference]: Finished difference Result 396 states and 615 transitions. [2022-04-28 08:45:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2022-04-28 08:45:17,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:17,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:17,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:17,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:17,397 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-28 08:45:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 602 transitions. [2022-04-28 08:45:17,403 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 602 transitions. Word has length 65 [2022-04-28 08:45:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:17,403 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 602 transitions. [2022-04-28 08:45:17,404 INFO L496 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-28 08:45:17,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 602 transitions. [2022-04-28 08:45:18,546 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-28 08:45:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 602 transitions. [2022-04-28 08:45:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:45:18,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:18,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:45:18,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash 213696620, now seen corresponding path program 1 times [2022-04-28 08:45:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:18,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020271333] [2022-04-28 08:45:18,561 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:45:18,562 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:45:18,562 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:45:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash 213696620, now seen corresponding path program 2 times [2022-04-28 08:45:18,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:18,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812023494] [2022-04-28 08:45:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:18,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:18,671 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-28 08:45:18,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {20784#true} assume true; {20784#true} is VALID [2022-04-28 08:45:18,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20784#true} {20784#true} #710#return; {20784#true} is VALID [2022-04-28 08:45:18,672 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-28 08:45:18,672 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-28 08:45:18,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {20784#true} assume true; {20784#true} is VALID [2022-04-28 08:45:18,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20784#true} {20784#true} #710#return; {20784#true} is VALID [2022-04-28 08:45:18,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {20784#true} call #t~ret161 := main(); {20784#true} is VALID [2022-04-28 08:45:18,672 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-28 08:45:18,672 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-28 08:45:18,672 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-28 08:45:18,674 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-28 08:45:18,675 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-28 08:45:18,675 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-28 08:45:18,676 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-28 08:45:18,676 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-28 08:45:18,677 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-28 08:45:18,677 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-28 08:45:18,677 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-28 08:45:18,678 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-28 08:45:18,678 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-28 08:45:18,678 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-28 08:45:18,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {20785#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20785#false} is VALID [2022-04-28 08:45:18,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {20785#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20785#false} is VALID [2022-04-28 08:45:18,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {20785#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20785#false} is VALID [2022-04-28 08:45:18,679 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-28 08:45:18,679 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-28 08:45:18,679 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-28 08:45:18,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {20785#false} assume 12292 != #t~mem85;havoc #t~mem85; {20785#false} is VALID [2022-04-28 08:45:18,679 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-28 08:45:18,679 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-28 08:45:18,679 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-28 08:45:18,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {20785#false} ~skip~0 := 0; {20785#false} is VALID [2022-04-28 08:45:18,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {20785#false} assume !false; {20785#false} is VALID [2022-04-28 08:45:18,679 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,680 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,681 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-28 08:45:18,682 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-28 08:45:18,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {20785#false} assume 8641 == #t~mem76;havoc #t~mem76; {20785#false} is VALID [2022-04-28 08:45:18,682 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-28 08:45:18,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {20785#false} assume !(9 == ~blastFlag~0); {20785#false} is VALID [2022-04-28 08:45:18,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {20785#false} assume 12 == ~blastFlag~0; {20785#false} is VALID [2022-04-28 08:45:18,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {20785#false} assume !false; {20785#false} is VALID [2022-04-28 08:45:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:18,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:18,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812023494] [2022-04-28 08:45:18,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812023494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:18,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:18,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:18,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:18,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020271333] [2022-04-28 08:45:18,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020271333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:18,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:18,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349642731] [2022-04-28 08:45:18,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:45:18,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:18,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:18,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:18,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:45:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:18,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:45:18,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:45:18,730 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-28 08:45:20,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:22,250 INFO L93 Difference]: Finished difference Result 590 states and 922 transitions. [2022-04-28 08:45:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:45:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:45:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-28 08:45:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-04-28 08:45:22,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 458 transitions. [2022-04-28 08:45:22,545 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-28 08:45:22,556 INFO L225 Difference]: With dead ends: 590 [2022-04-28 08:45:22,556 INFO L226 Difference]: Without dead ends: 401 [2022-04-28 08:45:22,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:45:22,557 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 23 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:22,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 503 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 364 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:45:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-28 08:45:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 385. [2022-04-28 08:45:22,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:22,575 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-28 08:45:22,575 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-28 08:45:22,577 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-28 08:45:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:22,584 INFO L93 Difference]: Finished difference Result 401 states and 620 transitions. [2022-04-28 08:45:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 620 transitions. [2022-04-28 08:45:22,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:22,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:22,586 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-28 08:45:22,586 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-28 08:45:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:22,592 INFO L93 Difference]: Finished difference Result 401 states and 620 transitions. [2022-04-28 08:45:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 620 transitions. [2022-04-28 08:45:22,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:22,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:22,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:22,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:22,593 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-28 08:45:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 601 transitions. [2022-04-28 08:45:22,600 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 601 transitions. Word has length 66 [2022-04-28 08:45:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:22,600 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 601 transitions. [2022-04-28 08:45:22,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:22,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 601 transitions. [2022-04-28 08:45:23,729 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-28 08:45:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 601 transitions. [2022-04-28 08:45:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:45:23,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:23,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:23,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:45:23,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash -208594083, now seen corresponding path program 1 times [2022-04-28 08:45:23,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:23,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684721422] [2022-04-28 08:45:23,864 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-28 08:45:23,865 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:45:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -61266088, now seen corresponding path program 1 times [2022-04-28 08:45:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:23,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011363066] [2022-04-28 08:45:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:23,969 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-28 08:45:23,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {23548#true} assume true; {23548#true} is VALID [2022-04-28 08:45:23,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23548#true} {23548#true} #710#return; {23548#true} is VALID [2022-04-28 08:45:23,970 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-28 08:45:23,970 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-28 08:45:23,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {23548#true} assume true; {23548#true} is VALID [2022-04-28 08:45:23,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23548#true} {23548#true} #710#return; {23548#true} is VALID [2022-04-28 08:45:23,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {23548#true} call #t~ret161 := main(); {23548#true} is VALID [2022-04-28 08:45:23,970 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-28 08:45:23,970 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-28 08:45:23,970 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-28 08:45:23,971 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-28 08:45:23,971 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-28 08:45:23,971 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-28 08:45:23,972 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-28 08:45:23,972 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-28 08:45:23,972 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-28 08:45:23,973 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-28 08:45:23,973 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-28 08:45:23,973 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-28 08:45:23,974 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-28 08:45:23,974 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-28 08:45:23,974 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-28 08:45:23,975 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-28 08:45:23,975 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-28 08:45:23,975 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-28 08:45:23,975 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-28 08:45:23,976 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-28 08:45:23,976 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-28 08:45:23,976 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-28 08:45:23,977 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-28 08:45:23,977 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-28 08:45:23,977 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-28 08:45:23,978 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-28 08:45:23,978 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-28 08:45:23,978 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-28 08:45:23,978 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-28 08:45:23,979 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-28 08:45:23,979 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-28 08:45:23,979 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-28 08:45:23,980 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-28 08:45:23,980 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-28 08:45:23,980 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-28 08:45:23,980 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-28 08:45:23,981 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-28 08:45:23,981 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-28 08:45:23,981 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-28 08:45:23,982 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-28 08:45:23,982 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-28 08:45:23,982 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-28 08:45:23,983 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-28 08:45:23,983 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-28 08:45:23,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {23553#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {23549#false} is VALID [2022-04-28 08:45:23,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {23549#false} assume !false; {23549#false} is VALID [2022-04-28 08:45:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:23,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011363066] [2022-04-28 08:45:23,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011363066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:23,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:23,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:45:27,603 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:27,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684721422] [2022-04-28 08:45:27,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684721422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:27,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:27,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 08:45:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330778237] [2022-04-28 08:45:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:27,604 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-28 08:45:27,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:27,604 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-28 08:45:27,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:27,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 08:45:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 08:45:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:45:27,667 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-28 08:45:29,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:31,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:38,066 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-28 08:45:39,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:42,400 INFO L93 Difference]: Finished difference Result 579 states and 909 transitions. [2022-04-28 08:45:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 08:45:42,400 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-28 08:45:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:42,401 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-28 08:45:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 612 transitions. [2022-04-28 08:45:42,403 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-28 08:45:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 612 transitions. [2022-04-28 08:45:42,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 612 transitions. [2022-04-28 08:45:42,780 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-28 08:45:42,787 INFO L225 Difference]: With dead ends: 579 [2022-04-28 08:45:42,787 INFO L226 Difference]: Without dead ends: 397 [2022-04-28 08:45:42,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:45:42,788 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 146 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:42,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 786 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 858 Invalid, 1 Unknown, 18 Unchecked, 9.0s Time] [2022-04-28 08:45:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-28 08:45:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 385. [2022-04-28 08:45:42,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:42,800 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-28 08:45:42,800 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-28 08:45:42,801 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-28 08:45:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:42,808 INFO L93 Difference]: Finished difference Result 397 states and 616 transitions. [2022-04-28 08:45:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 616 transitions. [2022-04-28 08:45:42,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:42,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:42,809 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-28 08:45:42,809 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-28 08:45:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:42,815 INFO L93 Difference]: Finished difference Result 397 states and 616 transitions. [2022-04-28 08:45:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 616 transitions. [2022-04-28 08:45:42,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:42,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:42,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:42,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:42,816 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-28 08:45:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 601 transitions. [2022-04-28 08:45:42,823 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 601 transitions. Word has length 66 [2022-04-28 08:45:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:42,823 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 601 transitions. [2022-04-28 08:45:42,823 INFO L496 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-28 08:45:42,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 601 transitions. [2022-04-28 08:45:45,142 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-28 08:45:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 601 transitions. [2022-04-28 08:45:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:45:45,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:45,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:45,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:45:45,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash 684892255, now seen corresponding path program 1 times [2022-04-28 08:45:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:45,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2063319719] [2022-04-28 08:45:45,331 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-28 08:45:45,332 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:45:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash 203898648, now seen corresponding path program 1 times [2022-04-28 08:45:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:45,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512344733] [2022-04-28 08:45:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:45,449 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-28 08:45:45,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {26290#true} assume true; {26290#true} is VALID [2022-04-28 08:45:45,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26290#true} {26290#true} #710#return; {26290#true} is VALID [2022-04-28 08:45:45,450 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-28 08:45:45,450 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-28 08:45:45,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {26290#true} assume true; {26290#true} is VALID [2022-04-28 08:45:45,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26290#true} {26290#true} #710#return; {26290#true} is VALID [2022-04-28 08:45:45,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {26290#true} call #t~ret161 := main(); {26290#true} is VALID [2022-04-28 08:45:45,450 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-28 08:45:45,450 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-28 08:45:45,450 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-28 08:45:45,450 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-28 08:45:45,451 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-28 08:45:45,451 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-28 08:45:45,451 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-28 08:45:45,451 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-28 08:45:45,452 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-28 08:45:45,452 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-28 08:45:45,452 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-28 08:45:45,453 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-28 08:45:45,453 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-28 08:45:45,453 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-28 08:45:45,453 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-28 08:45:45,454 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-28 08:45:45,454 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-28 08:45:45,454 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-28 08:45:45,455 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-28 08:45:45,455 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-28 08:45:45,455 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-28 08:45:45,455 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-28 08:45:45,456 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-28 08:45:45,456 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-28 08:45:45,456 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-28 08:45:45,456 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-28 08:45:45,457 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-28 08:45:45,457 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-28 08:45:45,457 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-28 08:45:45,457 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-28 08:45:45,458 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-28 08:45:45,458 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-28 08:45:45,458 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-28 08:45:45,459 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-28 08:45:45,459 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-28 08:45:45,459 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-28 08:45:45,459 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-28 08:45:45,460 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-28 08:45:45,460 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-28 08:45:45,460 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-28 08:45:45,460 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-28 08:45:45,461 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-28 08:45:45,461 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-28 08:45:45,461 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-28 08:45:45,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {26295#(= ssl3_accept_~blastFlag~0 0)} assume 12 == ~blastFlag~0; {26291#false} is VALID [2022-04-28 08:45:45,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {26291#false} assume !false; {26291#false} is VALID [2022-04-28 08:45:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:45,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:45,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512344733] [2022-04-28 08:45:45,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512344733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:45,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:45,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:45:49,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:49,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2063319719] [2022-04-28 08:45:49,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2063319719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:49,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:49,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 08:45:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276881868] [2022-04-28 08:45:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:49,834 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-28 08:45:49,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:49,834 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-28 08:45:49,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:49,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 08:45:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:49,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 08:45:49,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:45:49,901 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-28 08:45:52,337 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-28 08:45:54,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:56,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:45:58,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:04,504 INFO L93 Difference]: Finished difference Result 755 states and 1196 transitions. [2022-04-28 08:46:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 08:46:04,505 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-28 08:46:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:04,505 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-28 08:46:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 633 transitions. [2022-04-28 08:46:04,507 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-28 08:46:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 633 transitions. [2022-04-28 08:46:04,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 633 transitions. [2022-04-28 08:46:04,923 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-28 08:46:04,936 INFO L225 Difference]: With dead ends: 755 [2022-04-28 08:46:04,936 INFO L226 Difference]: Without dead ends: 573 [2022-04-28 08:46:04,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:46:04,937 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 154 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:46:04,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1081 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 773 Invalid, 3 Unknown, 702 Unchecked, 9.4s Time] [2022-04-28 08:46:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-04-28 08:46:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 564. [2022-04-28 08:46:04,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:04,953 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-28 08:46:04,953 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-28 08:46:04,954 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-28 08:46:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:04,964 INFO L93 Difference]: Finished difference Result 573 states and 890 transitions. [2022-04-28 08:46:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 890 transitions. [2022-04-28 08:46:04,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:04,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:04,965 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-28 08:46:04,966 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-28 08:46:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:04,977 INFO L93 Difference]: Finished difference Result 573 states and 890 transitions. [2022-04-28 08:46:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 890 transitions. [2022-04-28 08:46:04,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:04,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:04,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:04,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:04,978 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-28 08:46:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 879 transitions. [2022-04-28 08:46:04,991 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 879 transitions. Word has length 66 [2022-04-28 08:46:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:04,991 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 879 transitions. [2022-04-28 08:46:04,991 INFO L496 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-28 08:46:04,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 564 states and 879 transitions. [2022-04-28 08:46:07,772 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-28 08:46:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 879 transitions. [2022-04-28 08:46:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:46:07,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:07,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:46:07,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:46:07,773 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash -260095797, now seen corresponding path program 1 times [2022-04-28 08:46:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:07,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010686165] [2022-04-28 08:46:07,798 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:46:07,798 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:46:07,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:46:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash -260095797, now seen corresponding path program 2 times [2022-04-28 08:46:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:07,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635978167] [2022-04-28 08:46:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:07,966 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-28 08:46:07,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {30094#true} assume true; {30094#true} is VALID [2022-04-28 08:46:07,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30094#true} {30094#true} #710#return; {30094#true} is VALID [2022-04-28 08:46:07,967 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-28 08:46:07,967 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-28 08:46:07,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {30094#true} assume true; {30094#true} is VALID [2022-04-28 08:46:07,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30094#true} {30094#true} #710#return; {30094#true} is VALID [2022-04-28 08:46:07,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {30094#true} call #t~ret161 := main(); {30094#true} is VALID [2022-04-28 08:46:07,967 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-28 08:46:07,967 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {30094#true} assume !false; {30094#true} is VALID [2022-04-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,968 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-28 08:46:07,969 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-28 08:46:07,969 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-28 08:46:07,969 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-28 08:46:07,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#true} assume 8464 == #t~mem55;havoc #t~mem55; {30094#true} is VALID [2022-04-28 08:46:07,969 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-28 08:46:07,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30094#true} is VALID [2022-04-28 08:46:07,980 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-28 08:46:07,980 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-28 08:46:07,981 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-28 08:46:07,981 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-28 08:46:07,981 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-28 08:46:07,982 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-28 08:46:07,982 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-28 08:46:07,982 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-28 08:46:07,983 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-28 08:46:07,983 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-28 08:46:07,983 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-28 08:46:07,984 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-28 08:46:07,984 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-28 08:46:07,984 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-28 08:46:07,985 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-28 08:46:07,985 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-28 08:46:07,985 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-28 08:46:07,985 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-28 08:46:07,986 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-28 08:46:07,986 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-28 08:46:07,987 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-28 08:46:07,987 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-28 08:46:07,987 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-28 08:46:07,987 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-28 08:46:07,988 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-28 08:46:07,988 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-28 08:46:07,988 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-28 08:46:07,989 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-28 08:46:07,989 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-28 08:46:07,989 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-28 08:46:07,990 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-28 08:46:07,990 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-28 08:46:07,990 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-28 08:46:07,991 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-28 08:46:07,991 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-28 08:46:07,991 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-28 08:46:07,991 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-28 08:46:07,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {30095#false} assume !(9 == ~blastFlag~0); {30095#false} is VALID [2022-04-28 08:46:07,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {30095#false} assume 12 == ~blastFlag~0; {30095#false} is VALID [2022-04-28 08:46:07,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {30095#false} assume !false; {30095#false} is VALID [2022-04-28 08:46:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:46:07,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:07,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635978167] [2022-04-28 08:46:07,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635978167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:07,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:07,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:07,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:07,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010686165] [2022-04-28 08:46:07,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010686165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:07,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:07,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:07,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29700998] [2022-04-28 08:46:07,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:46:07,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:07,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:08,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:08,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:46:08,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:08,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:46:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:46:08,045 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-28 08:46:10,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:13,403 INFO L93 Difference]: Finished difference Result 1424 states and 2214 transitions. [2022-04-28 08:46:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:46:13,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:46:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-28 08:46:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-28 08:46:13,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 614 transitions. [2022-04-28 08:46:13,796 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-28 08:46:13,828 INFO L225 Difference]: With dead ends: 1424 [2022-04-28 08:46:13,828 INFO L226 Difference]: Without dead ends: 886 [2022-04-28 08:46:13,829 INFO L412 NwaCegarLoop]: 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-28 08:46:13,830 INFO L413 NwaCegarLoop]: 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-28 08:46:13,830 INFO L414 NwaCegarLoop]: 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-28 08:46:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-04-28 08:46:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 648. [2022-04-28 08:46:13,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:13,857 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-28 08:46:13,857 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-28 08:46:13,858 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-28 08:46:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:13,880 INFO L93 Difference]: Finished difference Result 886 states and 1366 transitions. [2022-04-28 08:46:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1366 transitions. [2022-04-28 08:46:13,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:13,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:13,882 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-28 08:46:13,882 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-28 08:46:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:13,905 INFO L93 Difference]: Finished difference Result 886 states and 1366 transitions. [2022-04-28 08:46:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1366 transitions. [2022-04-28 08:46:13,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:13,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:13,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:13,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:13,906 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-28 08:46:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1044 transitions. [2022-04-28 08:46:13,922 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1044 transitions. Word has length 67 [2022-04-28 08:46:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:13,923 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 1044 transitions. [2022-04-28 08:46:13,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:13,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 648 states and 1044 transitions. [2022-04-28 08:46:16,825 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-28 08:46:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1044 transitions. [2022-04-28 08:46:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 08:46:16,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:16,827 INFO L195 NwaCegarLoop]: 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-28 08:46:16,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:46:16,827 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash -344516719, now seen corresponding path program 1 times [2022-04-28 08:46:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:16,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934390058] [2022-04-28 08:46:16,867 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:46:16,868 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:46:16,868 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:46:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash -344516719, now seen corresponding path program 2 times [2022-04-28 08:46:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:16,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999651712] [2022-04-28 08:46:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:17,027 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-28 08:46:17,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {36022#true} assume true; {36022#true} is VALID [2022-04-28 08:46:17,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36022#true} {36022#true} #710#return; {36022#true} is VALID [2022-04-28 08:46:17,028 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-28 08:46:17,028 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-28 08:46:17,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {36022#true} assume true; {36022#true} is VALID [2022-04-28 08:46:17,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36022#true} {36022#true} #710#return; {36022#true} is VALID [2022-04-28 08:46:17,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {36022#true} call #t~ret161 := main(); {36022#true} is VALID [2022-04-28 08:46:17,028 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {36022#true} assume !false; {36022#true} is VALID [2022-04-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,029 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-28 08:46:17,030 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-28 08:46:17,030 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-28 08:46:17,030 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-28 08:46:17,030 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-28 08:46:17,030 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-28 08:46:17,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {36022#true} assume 8464 == #t~mem55;havoc #t~mem55; {36022#true} is VALID [2022-04-28 08:46:17,030 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-28 08:46:17,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {36022#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36022#true} is VALID [2022-04-28 08:46:17,031 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-28 08:46:17,031 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-28 08:46:17,032 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-28 08:46:17,032 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-28 08:46:17,033 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-28 08:46:17,033 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-28 08:46:17,033 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-28 08:46:17,034 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-28 08:46:17,034 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-28 08:46:17,034 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-28 08:46:17,035 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-28 08:46:17,035 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-28 08:46:17,035 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-28 08:46:17,036 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-28 08:46:17,036 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-28 08:46:17,036 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-28 08:46:17,037 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-28 08:46:17,037 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-28 08:46:17,038 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-28 08:46:17,038 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-28 08:46:17,038 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-28 08:46:17,039 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-28 08:46:17,039 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-28 08:46:17,039 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-28 08:46:17,040 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-28 08:46:17,040 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-28 08:46:17,040 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-28 08:46:17,041 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-28 08:46:17,041 INFO L290 TraceCheckUtils]: 55: Hoare triple {36023#false} assume !(~num1~0 > 0); {36023#false} is VALID [2022-04-28 08:46:17,041 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-28 08:46:17,041 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-28 08:46:17,041 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-28 08:46:17,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {36023#false} ~skip~0 := 0; {36023#false} is VALID [2022-04-28 08:46:17,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {36023#false} assume !false; {36023#false} is VALID [2022-04-28 08:46:17,041 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-28 08:46:17,041 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-28 08:46:17,041 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,042 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 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-28 08:46:17,043 INFO L290 TraceCheckUtils]: 90: Hoare triple {36023#false} assume 8640 == #t~mem75;havoc #t~mem75; {36023#false} is VALID [2022-04-28 08:46:17,043 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-28 08:46:17,043 INFO L290 TraceCheckUtils]: 92: Hoare triple {36023#false} assume !(9 == ~blastFlag~0); {36023#false} is VALID [2022-04-28 08:46:17,044 INFO L290 TraceCheckUtils]: 93: Hoare triple {36023#false} assume 12 == ~blastFlag~0; {36023#false} is VALID [2022-04-28 08:46:17,044 INFO L290 TraceCheckUtils]: 94: Hoare triple {36023#false} assume !false; {36023#false} is VALID [2022-04-28 08:46:17,044 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-28 08:46:17,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:17,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999651712] [2022-04-28 08:46:17,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999651712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:17,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:17,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:17,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:17,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934390058] [2022-04-28 08:46:17,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934390058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:17,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:17,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093237805] [2022-04-28 08:46:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:17,045 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-28 08:46:17,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:17,045 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-28 08:46:17,114 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-28 08:46:17,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:46:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:46:17,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:46:17,115 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-28 08:46:20,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:25,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:29,940 INFO L93 Difference]: Finished difference Result 1736 states and 2796 transitions. [2022-04-28 08:46:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:46:29,940 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-28 08:46:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:29,940 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-28 08:46:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:46:29,943 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-28 08:46:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:46:29,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-28 08:46:30,357 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-28 08:46:30,407 INFO L225 Difference]: With dead ends: 1736 [2022-04-28 08:46:30,408 INFO L226 Difference]: Without dead ends: 1114 [2022-04-28 08:46:30,408 INFO L412 NwaCegarLoop]: 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-28 08:46:30,409 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 135 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:46:30,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 646 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-28 08:46:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2022-04-28 08:46:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 840. [2022-04-28 08:46:30,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:30,439 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-28 08:46:30,440 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-28 08:46:30,441 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-28 08:46:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:30,474 INFO L93 Difference]: Finished difference Result 1114 states and 1780 transitions. [2022-04-28 08:46:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1780 transitions. [2022-04-28 08:46:30,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:30,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:30,476 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-28 08:46:30,477 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-28 08:46:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:30,510 INFO L93 Difference]: Finished difference Result 1114 states and 1780 transitions. [2022-04-28 08:46:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1780 transitions. [2022-04-28 08:46:30,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:30,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:30,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:30,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:30,513 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-28 08:46:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1386 transitions. [2022-04-28 08:46:30,541 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1386 transitions. Word has length 95 [2022-04-28 08:46:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:30,541 INFO L495 AbstractCegarLoop]: Abstraction has 840 states and 1386 transitions. [2022-04-28 08:46:30,541 INFO L496 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-28 08:46:30,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 840 states and 1386 transitions. [2022-04-28 08:46:33,745 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-28 08:46:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1386 transitions. [2022-04-28 08:46:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 08:46:33,752 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:33,752 INFO L195 NwaCegarLoop]: 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-28 08:46:33,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:46:33,752 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash 812039111, now seen corresponding path program 1 times [2022-04-28 08:46:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:33,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494012800] [2022-04-28 08:46:33,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:46:33,800 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:46:33,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:46:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 812039111, now seen corresponding path program 2 times [2022-04-28 08:46:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:33,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950834530] [2022-04-28 08:46:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:33,967 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-28 08:46:33,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {43414#true} assume true; {43414#true} is VALID [2022-04-28 08:46:33,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43414#true} {43414#true} #710#return; {43414#true} is VALID [2022-04-28 08:46:33,968 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-28 08:46:33,968 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-28 08:46:33,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {43414#true} assume true; {43414#true} is VALID [2022-04-28 08:46:33,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43414#true} {43414#true} #710#return; {43414#true} is VALID [2022-04-28 08:46:33,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {43414#true} call #t~ret161 := main(); {43414#true} is VALID [2022-04-28 08:46:33,968 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {43414#true} assume !false; {43414#true} is VALID [2022-04-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,969 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-28 08:46:33,970 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-28 08:46:33,970 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-28 08:46:33,970 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-28 08:46:33,970 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-28 08:46:33,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {43414#true} assume 8464 == #t~mem55;havoc #t~mem55; {43414#true} is VALID [2022-04-28 08:46:33,970 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-28 08:46:33,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {43414#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43414#true} is VALID [2022-04-28 08:46:33,971 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-28 08:46:33,971 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-28 08:46:33,972 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-28 08:46:33,972 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-28 08:46:33,972 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-28 08:46:33,973 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-28 08:46:33,973 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-28 08:46:33,973 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-28 08:46:33,974 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-28 08:46:33,974 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-28 08:46:33,975 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-28 08:46:33,975 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-28 08:46:33,975 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-28 08:46:33,976 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-28 08:46:33,976 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-28 08:46:33,976 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,977 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-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {43415#false} assume 8608 == #t~mem73;havoc #t~mem73; {43415#false} is VALID [2022-04-28 08:46:33,978 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-28 08:46:33,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {43415#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {43415#false} is VALID [2022-04-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 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-28 08:46:33,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {43415#false} ~skip~0 := 0; {43415#false} is VALID [2022-04-28 08:46:33,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {43415#false} assume !false; {43415#false} is VALID [2022-04-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,979 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,980 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-28 08:46:33,981 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-28 08:46:33,981 INFO L290 TraceCheckUtils]: 96: Hoare triple {43415#false} assume 8640 == #t~mem75;havoc #t~mem75; {43415#false} is VALID [2022-04-28 08:46:33,981 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-28 08:46:33,981 INFO L290 TraceCheckUtils]: 98: Hoare triple {43415#false} assume !(9 == ~blastFlag~0); {43415#false} is VALID [2022-04-28 08:46:33,981 INFO L290 TraceCheckUtils]: 99: Hoare triple {43415#false} assume 12 == ~blastFlag~0; {43415#false} is VALID [2022-04-28 08:46:33,981 INFO L290 TraceCheckUtils]: 100: Hoare triple {43415#false} assume !false; {43415#false} is VALID [2022-04-28 08:46:33,981 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-28 08:46:33,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:33,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950834530] [2022-04-28 08:46:33,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950834530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:33,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:33,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:33,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494012800] [2022-04-28 08:46:33,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494012800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:33,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:33,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:33,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471220532] [2022-04-28 08:46:33,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:33,982 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-28 08:46:33,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:33,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:34,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:34,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:46:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:46:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:46:34,043 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-28 08:46:40,373 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-28 08:46:43,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:47,435 INFO L93 Difference]: Finished difference Result 1157 states and 1912 transitions. [2022-04-28 08:46:47,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:46:47,435 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-28 08:46:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-28 08:46:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2022-04-28 08:46:47,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 488 transitions. [2022-04-28 08:46:47,733 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-28 08:46:47,764 INFO L225 Difference]: With dead ends: 1157 [2022-04-28 08:46:47,764 INFO L226 Difference]: Without dead ends: 883 [2022-04-28 08:46:47,765 INFO L412 NwaCegarLoop]: 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-28 08:46:47,765 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 33 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:46:47,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 613 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 08:46:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-04-28 08:46:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 862. [2022-04-28 08:46:47,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:47,796 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-28 08:46:47,797 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-28 08:46:47,797 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-28 08:46:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:47,824 INFO L93 Difference]: Finished difference Result 883 states and 1450 transitions. [2022-04-28 08:46:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1450 transitions. [2022-04-28 08:46:47,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:47,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:47,826 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-28 08:46:47,826 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-28 08:46:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:47,849 INFO L93 Difference]: Finished difference Result 883 states and 1450 transitions. [2022-04-28 08:46:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1450 transitions. [2022-04-28 08:46:47,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:47,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:47,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:47,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:47,850 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-28 08:46:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1423 transitions. [2022-04-28 08:46:47,887 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1423 transitions. Word has length 101 [2022-04-28 08:46:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:47,887 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1423 transitions. [2022-04-28 08:46:47,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:47,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 862 states and 1423 transitions. [2022-04-28 08:46:51,184 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-28 08:46:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1423 transitions. [2022-04-28 08:46:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 08:46:51,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:51,186 INFO L195 NwaCegarLoop]: 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-28 08:46:51,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:46:51,186 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:51,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1267586020, now seen corresponding path program 1 times [2022-04-28 08:46:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:51,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943201732] [2022-04-28 08:46:51,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:46:51,238 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:46:51,238 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:46:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1267586020, now seen corresponding path program 2 times [2022-04-28 08:46:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:51,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88941631] [2022-04-28 08:46:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:51,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:51,396 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-28 08:46:51,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {49230#true} assume true; {49230#true} is VALID [2022-04-28 08:46:51,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49230#true} {49230#true} #710#return; {49230#true} is VALID [2022-04-28 08:46:51,397 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-28 08:46:51,397 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-28 08:46:51,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {49230#true} assume true; {49230#true} is VALID [2022-04-28 08:46:51,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49230#true} {49230#true} #710#return; {49230#true} is VALID [2022-04-28 08:46:51,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {49230#true} call #t~ret161 := main(); {49230#true} is VALID [2022-04-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {49230#true} assume !false; {49230#true} is VALID [2022-04-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,398 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-28 08:46:51,399 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-28 08:46:51,399 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-28 08:46:51,399 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-28 08:46:51,399 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-28 08:46:51,399 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-28 08:46:51,399 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-28 08:46:51,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {49230#true} assume 8464 == #t~mem55;havoc #t~mem55; {49230#true} is VALID [2022-04-28 08:46:51,399 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-28 08:46:51,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {49230#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49230#true} is VALID [2022-04-28 08:46:51,400 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-28 08:46:51,401 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-28 08:46:51,401 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-28 08:46:51,401 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-28 08:46:51,402 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-28 08:46:51,402 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-28 08:46:51,402 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-28 08:46:51,403 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-28 08:46:51,403 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-28 08:46:51,404 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-28 08:46:51,404 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-28 08:46:51,404 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-28 08:46:51,404 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-28 08:46:51,404 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-28 08:46:51,404 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-28 08:46:51,405 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-28 08:46:51,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {49231#false} ~skip~0 := 0; {49231#false} is VALID [2022-04-28 08:46:51,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {49231#false} assume !false; {49231#false} is VALID [2022-04-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,405 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 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-28 08:46:51,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {49231#false} assume 8448 == #t~mem68;havoc #t~mem68; {49231#false} is VALID [2022-04-28 08:46:51,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {49231#false} assume !(~num1~0 > 0); {49231#false} is VALID [2022-04-28 08:46:51,406 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 INFO L290 TraceCheckUtils]: 72: Hoare triple {49231#false} ~skip~0 := 0; {49231#false} is VALID [2022-04-28 08:46:51,407 INFO L290 TraceCheckUtils]: 73: Hoare triple {49231#false} assume !false; {49231#false} is VALID [2022-04-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,407 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,408 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-28 08:46:51,409 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-28 08:46:51,409 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-28 08:46:51,409 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-28 08:46:51,409 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-28 08:46:51,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {49231#false} assume 8640 == #t~mem75;havoc #t~mem75; {49231#false} is VALID [2022-04-28 08:46:51,409 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-28 08:46:51,409 INFO L290 TraceCheckUtils]: 105: Hoare triple {49231#false} assume !(9 == ~blastFlag~0); {49231#false} is VALID [2022-04-28 08:46:51,409 INFO L290 TraceCheckUtils]: 106: Hoare triple {49231#false} assume 12 == ~blastFlag~0; {49231#false} is VALID [2022-04-28 08:46:51,409 INFO L290 TraceCheckUtils]: 107: Hoare triple {49231#false} assume !false; {49231#false} is VALID [2022-04-28 08:46:51,409 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-28 08:46:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:51,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88941631] [2022-04-28 08:46:51,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88941631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:51,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:51,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:51,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943201732] [2022-04-28 08:46:51,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943201732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:51,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780333823] [2022-04-28 08:46:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:51,411 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-28 08:46:51,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:51,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:51,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:51,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:46:51,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:51,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:46:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:46:51,468 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-28 08:46:57,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:03,411 INFO L93 Difference]: Finished difference Result 1179 states and 1948 transitions. [2022-04-28 08:47:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:47:03,411 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-28 08:47:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-28 08:47:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-28 08:47:03,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 487 transitions. [2022-04-28 08:47:03,711 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-28 08:47:03,743 INFO L225 Difference]: With dead ends: 1179 [2022-04-28 08:47:03,743 INFO L226 Difference]: Without dead ends: 883 [2022-04-28 08:47:03,744 INFO L412 NwaCegarLoop]: 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-28 08:47:03,744 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 38 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s 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, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:03,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 613 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 454 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 08:47:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-04-28 08:47:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 862. [2022-04-28 08:47:03,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:03,779 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-28 08:47:03,780 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-28 08:47:03,780 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-28 08:47:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:03,802 INFO L93 Difference]: Finished difference Result 883 states and 1449 transitions. [2022-04-28 08:47:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1449 transitions. [2022-04-28 08:47:03,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:03,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:03,804 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-28 08:47:03,805 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-28 08:47:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:03,827 INFO L93 Difference]: Finished difference Result 883 states and 1449 transitions. [2022-04-28 08:47:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1449 transitions. [2022-04-28 08:47:03,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:03,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:03,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:03,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:03,829 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-28 08:47:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1422 transitions. [2022-04-28 08:47:03,857 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1422 transitions. Word has length 108 [2022-04-28 08:47:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:03,857 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1422 transitions. [2022-04-28 08:47:03,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:03,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 862 states and 1422 transitions. [2022-04-28 08:47:07,194 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-28 08:47:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1422 transitions. [2022-04-28 08:47:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 08:47:07,195 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:07,195 INFO L195 NwaCegarLoop]: 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-28 08:47:07,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:47:07,196 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1455335179, now seen corresponding path program 1 times [2022-04-28 08:47:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:07,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710953531] [2022-04-28 08:47:07,248 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:47:07,249 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:47:07,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:47:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1455335179, now seen corresponding path program 2 times [2022-04-28 08:47:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:07,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423890601] [2022-04-28 08:47:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:07,402 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-28 08:47:07,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {55090#true} assume true; {55090#true} is VALID [2022-04-28 08:47:07,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55090#true} {55090#true} #710#return; {55090#true} is VALID [2022-04-28 08:47:07,403 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-28 08:47:07,403 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-28 08:47:07,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {55090#true} assume true; {55090#true} is VALID [2022-04-28 08:47:07,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55090#true} {55090#true} #710#return; {55090#true} is VALID [2022-04-28 08:47:07,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {55090#true} call #t~ret161 := main(); {55090#true} is VALID [2022-04-28 08:47:07,403 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-28 08:47:07,403 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-28 08:47:07,403 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {55090#true} assume !false; {55090#true} is VALID [2022-04-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,404 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-28 08:47:07,405 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-28 08:47:07,405 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-28 08:47:07,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {55090#true} assume 8464 == #t~mem55;havoc #t~mem55; {55090#true} is VALID [2022-04-28 08:47:07,405 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-28 08:47:07,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {55090#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55090#true} is VALID [2022-04-28 08:47:07,406 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-28 08:47:07,406 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-28 08:47:07,407 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-28 08:47:07,407 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-28 08:47:07,407 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-28 08:47:07,408 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-28 08:47:07,408 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-28 08:47:07,408 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-28 08:47:07,409 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-28 08:47:07,409 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-28 08:47:07,409 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-28 08:47:07,410 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-28 08:47:07,410 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-28 08:47:07,410 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-28 08:47:07,410 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-28 08:47:07,410 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-28 08:47:07,410 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-28 08:47:07,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {55091#false} ~skip~0 := 0; {55091#false} is VALID [2022-04-28 08:47:07,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {55091#false} assume !false; {55091#false} is VALID [2022-04-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,411 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {55091#false} assume 8448 == #t~mem68;havoc #t~mem68; {55091#false} is VALID [2022-04-28 08:47:07,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {55091#false} assume !(~num1~0 > 0); {55091#false} is VALID [2022-04-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 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-28 08:47:07,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {55091#false} ~skip~0 := 0; {55091#false} is VALID [2022-04-28 08:47:07,413 INFO L290 TraceCheckUtils]: 74: Hoare triple {55091#false} assume !false; {55091#false} is VALID [2022-04-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,413 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,414 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-28 08:47:07,415 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-28 08:47:07,415 INFO L290 TraceCheckUtils]: 104: Hoare triple {55091#false} assume 8640 == #t~mem75;havoc #t~mem75; {55091#false} is VALID [2022-04-28 08:47:07,415 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-28 08:47:07,415 INFO L290 TraceCheckUtils]: 106: Hoare triple {55091#false} assume !(9 == ~blastFlag~0); {55091#false} is VALID [2022-04-28 08:47:07,415 INFO L290 TraceCheckUtils]: 107: Hoare triple {55091#false} assume 12 == ~blastFlag~0; {55091#false} is VALID [2022-04-28 08:47:07,415 INFO L290 TraceCheckUtils]: 108: Hoare triple {55091#false} assume !false; {55091#false} is VALID [2022-04-28 08:47:07,415 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-28 08:47:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:07,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423890601] [2022-04-28 08:47:07,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423890601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:07,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:07,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:07,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:07,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710953531] [2022-04-28 08:47:07,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710953531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:07,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:07,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505176669] [2022-04-28 08:47:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:07,416 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-28 08:47:07,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:07,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:07,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:07,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:47:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:47:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:47:07,473 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-28 08:47:11,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:13,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:16,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:20,447 INFO L93 Difference]: Finished difference Result 1177 states and 1944 transitions. [2022-04-28 08:47:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:47:20,448 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-28 08:47:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-28 08:47:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-28 08:47:20,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-28 08:47:20,749 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-28 08:47:20,786 INFO L225 Difference]: With dead ends: 1177 [2022-04-28 08:47:20,786 INFO L226 Difference]: Without dead ends: 881 [2022-04-28 08:47:20,786 INFO L412 NwaCegarLoop]: 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-28 08:47:20,787 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 36 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:20,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 611 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 446 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-28 08:47:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-04-28 08:47:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 862. [2022-04-28 08:47:20,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:20,814 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-28 08:47:20,815 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-28 08:47:20,816 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-28 08:47:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:20,837 INFO L93 Difference]: Finished difference Result 881 states and 1446 transitions. [2022-04-28 08:47:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1446 transitions. [2022-04-28 08:47:20,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:20,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:20,839 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-28 08:47:20,839 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-28 08:47:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:20,861 INFO L93 Difference]: Finished difference Result 881 states and 1446 transitions. [2022-04-28 08:47:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1446 transitions. [2022-04-28 08:47:20,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:20,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:20,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:20,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:20,863 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-28 08:47:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1421 transitions. [2022-04-28 08:47:20,892 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1421 transitions. Word has length 109 [2022-04-28 08:47:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:20,892 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1421 transitions. [2022-04-28 08:47:20,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:20,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 862 states and 1421 transitions. [2022-04-28 08:47:24,173 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-28 08:47:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1421 transitions. [2022-04-28 08:47:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 08:47:24,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:24,179 INFO L195 NwaCegarLoop]: 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-28 08:47:24,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:47:24,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1251834250, now seen corresponding path program 1 times [2022-04-28 08:47:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:24,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [124791913] [2022-04-28 08:47:24,249 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:47:24,249 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:47:24,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:47:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1251834250, now seen corresponding path program 2 times [2022-04-28 08:47:24,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:24,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087898839] [2022-04-28 08:47:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:24,426 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-28 08:47:24,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {60942#true} assume true; {60942#true} is VALID [2022-04-28 08:47:24,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60942#true} {60942#true} #710#return; {60942#true} is VALID [2022-04-28 08:47:24,427 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-28 08:47:24,427 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-28 08:47:24,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {60942#true} assume true; {60942#true} is VALID [2022-04-28 08:47:24,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60942#true} {60942#true} #710#return; {60942#true} is VALID [2022-04-28 08:47:24,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {60942#true} call #t~ret161 := main(); {60942#true} is VALID [2022-04-28 08:47:24,427 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-28 08:47:24,427 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-28 08:47:24,427 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-28 08:47:24,427 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-28 08:47:24,427 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-28 08:47:24,427 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {60942#true} assume !false; {60942#true} is VALID [2022-04-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 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-28 08:47:24,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {60942#true} assume 8464 == #t~mem55;havoc #t~mem55; {60942#true} is VALID [2022-04-28 08:47:24,428 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-28 08:47:24,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {60942#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {60942#true} is VALID [2022-04-28 08:47:24,429 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-28 08:47:24,429 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-28 08:47:24,429 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-28 08:47:24,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {60942#true} ~skip~0 := 0; {60942#true} is VALID [2022-04-28 08:47:24,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {60942#true} assume !false; {60942#true} is VALID [2022-04-28 08:47:24,429 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-28 08:47:24,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {60942#true} assume 12292 == #t~mem47;havoc #t~mem47; {60942#true} is VALID [2022-04-28 08:47:24,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {60942#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {60942#true} is VALID [2022-04-28 08:47:24,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {60942#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {60942#true} is VALID [2022-04-28 08:47:24,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {60942#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {60942#true} is VALID [2022-04-28 08:47:24,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {60942#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {60942#true} is VALID [2022-04-28 08:47:24,429 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-28 08:47:24,429 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-28 08:47:24,430 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-28 08:47:24,434 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-28 08:47:24,434 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-28 08:47:24,434 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-28 08:47:24,435 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-28 08:47:24,435 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-28 08:47:24,435 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-28 08:47:24,436 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-28 08:47:24,436 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-28 08:47:24,436 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-28 08:47:24,437 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-28 08:47:24,437 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-28 08:47:24,437 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-28 08:47:24,437 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-28 08:47:24,437 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-28 08:47:24,437 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,438 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-28 08:47:24,439 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-28 08:47:24,439 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-28 08:47:24,439 INFO L290 TraceCheckUtils]: 73: Hoare triple {60943#false} assume 8608 == #t~mem73;havoc #t~mem73; {60943#false} is VALID [2022-04-28 08:47:24,439 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-28 08:47:24,439 INFO L290 TraceCheckUtils]: 75: Hoare triple {60943#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {60943#false} is VALID [2022-04-28 08:47:24,439 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-28 08:47:24,439 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-28 08:47:24,439 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-28 08:47:24,439 INFO L290 TraceCheckUtils]: 79: Hoare triple {60943#false} ~skip~0 := 0; {60943#false} is VALID [2022-04-28 08:47:24,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {60943#false} assume !false; {60943#false} is VALID [2022-04-28 08:47:24,439 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-28 08:47:24,439 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-28 08:47:24,439 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-28 08:47:24,439 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,440 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 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-28 08:47:24,441 INFO L290 TraceCheckUtils]: 110: Hoare triple {60943#false} assume 8640 == #t~mem75;havoc #t~mem75; {60943#false} is VALID [2022-04-28 08:47:24,441 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-28 08:47:24,441 INFO L290 TraceCheckUtils]: 112: Hoare triple {60943#false} assume !(9 == ~blastFlag~0); {60943#false} is VALID [2022-04-28 08:47:24,441 INFO L290 TraceCheckUtils]: 113: Hoare triple {60943#false} assume 12 == ~blastFlag~0; {60943#false} is VALID [2022-04-28 08:47:24,442 INFO L290 TraceCheckUtils]: 114: Hoare triple {60943#false} assume !false; {60943#false} is VALID [2022-04-28 08:47:24,442 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-28 08:47:24,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:24,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087898839] [2022-04-28 08:47:24,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087898839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:24,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:24,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:24,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:24,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [124791913] [2022-04-28 08:47:24,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [124791913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:24,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:24,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94656312] [2022-04-28 08:47:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:24,443 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-28 08:47:24,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:24,444 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-28 08:47:24,506 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-28 08:47:24,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:47:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:24,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:47:24,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:47:24,507 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-28 08:47:27,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:29,935 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-28 08:47:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:36,443 INFO L93 Difference]: Finished difference Result 1501 states and 2465 transitions. [2022-04-28 08:47:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:47:36,444 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-28 08:47:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:36,444 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-28 08:47:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-28 08:47:36,446 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-28 08:47:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-28 08:47:36,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-28 08:47:36,725 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-28 08:47:36,761 INFO L225 Difference]: With dead ends: 1501 [2022-04-28 08:47:36,761 INFO L226 Difference]: Without dead ends: 927 [2022-04-28 08:47:36,762 INFO L412 NwaCegarLoop]: 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-28 08:47:36,762 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 21 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:36,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 595 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 407 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 08:47:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-04-28 08:47:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 894. [2022-04-28 08:47:36,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:36,792 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-28 08:47:36,792 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-28 08:47:36,793 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-28 08:47:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:36,817 INFO L93 Difference]: Finished difference Result 927 states and 1512 transitions. [2022-04-28 08:47:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1512 transitions. [2022-04-28 08:47:36,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:36,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:36,819 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-28 08:47:36,819 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-28 08:47:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:36,844 INFO L93 Difference]: Finished difference Result 927 states and 1512 transitions. [2022-04-28 08:47:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1512 transitions. [2022-04-28 08:47:36,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:36,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:36,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:36,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:36,846 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-28 08:47:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1471 transitions. [2022-04-28 08:47:36,876 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1471 transitions. Word has length 115 [2022-04-28 08:47:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:36,876 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1471 transitions. [2022-04-28 08:47:36,876 INFO L496 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-28 08:47:36,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 894 states and 1471 transitions. [2022-04-28 08:47:40,114 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-28 08:47:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1471 transitions. [2022-04-28 08:47:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 08:47:40,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:40,116 INFO L195 NwaCegarLoop]: 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-28 08:47:40,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:47:40,116 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:40,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1810474558, now seen corresponding path program 1 times [2022-04-28 08:47:40,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:40,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302179391] [2022-04-28 08:47:40,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:47:40,165 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:47:40,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:47:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1810474558, now seen corresponding path program 2 times [2022-04-28 08:47:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:40,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808430133] [2022-04-28 08:47:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:40,337 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-28 08:47:40,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {67598#true} assume true; {67598#true} is VALID [2022-04-28 08:47:40,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67598#true} {67598#true} #710#return; {67598#true} is VALID [2022-04-28 08:47:40,338 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-28 08:47:40,338 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-28 08:47:40,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {67598#true} assume true; {67598#true} is VALID [2022-04-28 08:47:40,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67598#true} {67598#true} #710#return; {67598#true} is VALID [2022-04-28 08:47:40,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {67598#true} call #t~ret161 := main(); {67598#true} is VALID [2022-04-28 08:47:40,338 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-28 08:47:40,338 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {67598#true} assume !false; {67598#true} is VALID [2022-04-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,339 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-28 08:47:40,340 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-28 08:47:40,340 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-28 08:47:40,340 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-28 08:47:40,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {67598#true} assume 8464 == #t~mem55;havoc #t~mem55; {67598#true} is VALID [2022-04-28 08:47:40,340 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-28 08:47:40,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {67598#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67598#true} is VALID [2022-04-28 08:47:40,341 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-28 08:47:40,341 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-28 08:47:40,342 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-28 08:47:40,342 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-28 08:47:40,342 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-28 08:47:40,343 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-28 08:47:40,343 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-28 08:47:40,343 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-28 08:47:40,344 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-28 08:47:40,344 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-28 08:47:40,345 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-28 08:47:40,345 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-28 08:47:40,345 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-28 08:47:40,346 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-28 08:47:40,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {67599#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {67599#false} is VALID [2022-04-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {67599#false} ~skip~0 := 0; {67599#false} is VALID [2022-04-28 08:47:40,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {67599#false} assume !false; {67599#false} is VALID [2022-04-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,346 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,347 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-28 08:47:40,348 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-28 08:47:40,348 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-28 08:47:40,348 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-28 08:47:40,348 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-28 08:47:40,348 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-28 08:47:40,348 INFO L290 TraceCheckUtils]: 73: Hoare triple {67599#false} assume 8608 == #t~mem73;havoc #t~mem73; {67599#false} is VALID [2022-04-28 08:47:40,348 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-28 08:47:40,348 INFO L290 TraceCheckUtils]: 75: Hoare triple {67599#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {67599#false} is VALID [2022-04-28 08:47:40,348 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-28 08:47:40,348 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-28 08:47:40,348 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-28 08:47:40,348 INFO L290 TraceCheckUtils]: 79: Hoare triple {67599#false} ~skip~0 := 0; {67599#false} is VALID [2022-04-28 08:47:40,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {67599#false} assume !false; {67599#false} is VALID [2022-04-28 08:47:40,348 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-28 08:47:40,348 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,349 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-28 08:47:40,350 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-28 08:47:40,350 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-28 08:47:40,350 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-28 08:47:40,350 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-28 08:47:40,350 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-28 08:47:40,355 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-28 08:47:40,355 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-28 08:47:40,355 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-28 08:47:40,355 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-28 08:47:40,355 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-28 08:47:40,355 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-28 08:47:40,355 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-28 08:47:40,355 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-28 08:47:40,356 INFO L290 TraceCheckUtils]: 110: Hoare triple {67599#false} assume 8640 == #t~mem75;havoc #t~mem75; {67599#false} is VALID [2022-04-28 08:47:40,356 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-28 08:47:40,356 INFO L290 TraceCheckUtils]: 112: Hoare triple {67599#false} assume !(9 == ~blastFlag~0); {67599#false} is VALID [2022-04-28 08:47:40,356 INFO L290 TraceCheckUtils]: 113: Hoare triple {67599#false} assume 12 == ~blastFlag~0; {67599#false} is VALID [2022-04-28 08:47:40,356 INFO L290 TraceCheckUtils]: 114: Hoare triple {67599#false} assume !false; {67599#false} is VALID [2022-04-28 08:47:40,356 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-28 08:47:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:40,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808430133] [2022-04-28 08:47:40,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808430133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:40,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:40,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:40,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:40,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302179391] [2022-04-28 08:47:40,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302179391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:40,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:40,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:40,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143998725] [2022-04-28 08:47:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:40,357 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-28 08:47:40,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:40,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:40,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:40,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:47:40,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:47:40,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:47:40,414 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-28 08:47:50,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:54,308 INFO L93 Difference]: Finished difference Result 1224 states and 2016 transitions. [2022-04-28 08:47:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:47:54,308 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-28 08:47:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2022-04-28 08:47:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2022-04-28 08:47:54,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 482 transitions. [2022-04-28 08:47:54,607 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-28 08:47:54,640 INFO L225 Difference]: With dead ends: 1224 [2022-04-28 08:47:54,640 INFO L226 Difference]: Without dead ends: 912 [2022-04-28 08:47:54,640 INFO L412 NwaCegarLoop]: 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-28 08:47:54,641 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 34 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:54,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 609 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 08:47:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-04-28 08:47:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 894. [2022-04-28 08:47:54,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:54,676 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-28 08:47:54,677 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-28 08:47:54,677 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-28 08:47:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:54,700 INFO L93 Difference]: Finished difference Result 912 states and 1494 transitions. [2022-04-28 08:47:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1494 transitions. [2022-04-28 08:47:54,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:54,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:54,701 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-28 08:47:54,702 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-28 08:47:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:54,724 INFO L93 Difference]: Finished difference Result 912 states and 1494 transitions. [2022-04-28 08:47:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1494 transitions. [2022-04-28 08:47:54,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:54,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:54,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:54,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:54,726 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-28 08:47:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1470 transitions. [2022-04-28 08:47:54,756 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1470 transitions. Word has length 115 [2022-04-28 08:47:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:54,756 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1470 transitions. [2022-04-28 08:47:54,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:54,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 894 states and 1470 transitions. [2022-04-28 08:47:58,031 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-28 08:47:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1470 transitions. [2022-04-28 08:47:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 08:47:58,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:58,033 INFO L195 NwaCegarLoop]: 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-28 08:47:58,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:47:58,033 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1335655467, now seen corresponding path program 1 times [2022-04-28 08:47:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:58,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590698861] [2022-04-28 08:47:58,100 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:47:58,100 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:47:58,100 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:47:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1335655467, now seen corresponding path program 2 times [2022-04-28 08:47:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:58,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436492726] [2022-04-28 08:47:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:58,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:58,296 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-28 08:47:58,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {73670#true} assume true; {73670#true} is VALID [2022-04-28 08:47:58,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73670#true} {73670#true} #710#return; {73670#true} is VALID [2022-04-28 08:47:58,297 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-28 08:47:58,297 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-28 08:47:58,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {73670#true} assume true; {73670#true} is VALID [2022-04-28 08:47:58,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73670#true} {73670#true} #710#return; {73670#true} is VALID [2022-04-28 08:47:58,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {73670#true} call #t~ret161 := main(); {73670#true} is VALID [2022-04-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {73670#true} assume !false; {73670#true} is VALID [2022-04-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,298 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-28 08:47:58,299 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-28 08:47:58,299 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-28 08:47:58,299 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-28 08:47:58,299 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-28 08:47:58,299 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-28 08:47:58,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {73670#true} assume 8464 == #t~mem55;havoc #t~mem55; {73670#true} is VALID [2022-04-28 08:47:58,299 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-28 08:47:58,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {73670#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73670#true} is VALID [2022-04-28 08:47:58,299 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-28 08:47:58,299 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-28 08:47:58,299 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-28 08:47:58,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {73670#true} ~skip~0 := 0; {73670#true} is VALID [2022-04-28 08:47:58,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {73670#true} assume !false; {73670#true} is VALID [2022-04-28 08:47:58,300 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-28 08:47:58,300 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-28 08:47:58,301 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-28 08:47:58,302 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-28 08:47:58,302 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-28 08:47:58,303 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-28 08:47:58,304 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-28 08:47:58,304 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-28 08:47:58,305 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-28 08:47:58,305 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-28 08:47:58,305 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-28 08:47:58,305 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-28 08:47:58,305 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-28 08:47:58,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {73671#false} ~skip~0 := 0; {73671#false} is VALID [2022-04-28 08:47:58,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {73671#false} assume !false; {73671#false} is VALID [2022-04-28 08:47:58,305 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,306 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 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-28 08:47:58,307 INFO L290 TraceCheckUtils]: 74: Hoare triple {73671#false} assume 8608 == #t~mem73;havoc #t~mem73; {73671#false} is VALID [2022-04-28 08:47:58,307 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-28 08:47:58,307 INFO L290 TraceCheckUtils]: 76: Hoare triple {73671#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {73671#false} is VALID [2022-04-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 INFO L290 TraceCheckUtils]: 80: Hoare triple {73671#false} ~skip~0 := 0; {73671#false} is VALID [2022-04-28 08:47:58,308 INFO L290 TraceCheckUtils]: 81: Hoare triple {73671#false} assume !false; {73671#false} is VALID [2022-04-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,308 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,309 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-28 08:47:58,310 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-28 08:47:58,310 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-28 08:47:58,310 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-28 08:47:58,310 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-28 08:47:58,310 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-28 08:47:58,310 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-28 08:47:58,310 INFO L290 TraceCheckUtils]: 111: Hoare triple {73671#false} assume 8640 == #t~mem75;havoc #t~mem75; {73671#false} is VALID [2022-04-28 08:47:58,310 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-28 08:47:58,310 INFO L290 TraceCheckUtils]: 113: Hoare triple {73671#false} assume !(9 == ~blastFlag~0); {73671#false} is VALID [2022-04-28 08:47:58,310 INFO L290 TraceCheckUtils]: 114: Hoare triple {73671#false} assume 12 == ~blastFlag~0; {73671#false} is VALID [2022-04-28 08:47:58,310 INFO L290 TraceCheckUtils]: 115: Hoare triple {73671#false} assume !false; {73671#false} is VALID [2022-04-28 08:47:58,311 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-28 08:47:58,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436492726] [2022-04-28 08:47:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436492726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:58,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:47:58,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590698861] [2022-04-28 08:47:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590698861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:58,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:47:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417224308] [2022-04-28 08:47:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:58,312 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-28 08:47:58,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:58,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:58,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:58,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:47:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:47:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:47:58,372 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-28 08:48:00,930 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-28 08:48:02,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:05,008 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-28 08:48:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:14,243 INFO L93 Difference]: Finished difference Result 1518 states and 2494 transitions. [2022-04-28 08:48:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:48:14,244 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-28 08:48:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:48:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2022-04-28 08:48:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2022-04-28 08:48:14,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 435 transitions. [2022-04-28 08:48:14,514 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-28 08:48:14,550 INFO L225 Difference]: With dead ends: 1518 [2022-04-28 08:48:14,550 INFO L226 Difference]: Without dead ends: 912 [2022-04-28 08:48:14,551 INFO L412 NwaCegarLoop]: 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-28 08:48:14,551 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:48:14,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 682 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 08:48:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-04-28 08:48:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2022-04-28 08:48:14,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:48:14,582 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-28 08:48:14,583 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-28 08:48:14,584 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-28 08:48:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:14,607 INFO L93 Difference]: Finished difference Result 912 states and 1492 transitions. [2022-04-28 08:48:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1492 transitions. [2022-04-28 08:48:14,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:14,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:14,608 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-28 08:48:14,609 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-28 08:48:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:14,632 INFO L93 Difference]: Finished difference Result 912 states and 1492 transitions. [2022-04-28 08:48:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1492 transitions. [2022-04-28 08:48:14,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:14,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:14,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:48:14,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:48:14,634 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-28 08:48:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1492 transitions. [2022-04-28 08:48:14,666 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1492 transitions. Word has length 116 [2022-04-28 08:48:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:48:14,666 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1492 transitions. [2022-04-28 08:48:14,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:14,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1492 transitions. [2022-04-28 08:48:17,922 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-28 08:48:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1492 transitions. [2022-04-28 08:48:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 08:48:17,924 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:48:17,924 INFO L195 NwaCegarLoop]: 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-28 08:48:17,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:48:17,924 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:48:17,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:48:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash 485213310, now seen corresponding path program 1 times [2022-04-28 08:48:17,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:17,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843078531] [2022-04-28 08:48:17,978 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:48:17,978 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:48:17,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:48:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash 485213310, now seen corresponding path program 2 times [2022-04-28 08:48:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:48:17,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72177676] [2022-04-28 08:48:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:48:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:48:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:48:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:18,146 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-28 08:48:18,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {80367#true} assume true; {80367#true} is VALID [2022-04-28 08:48:18,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80367#true} {80367#true} #710#return; {80367#true} is VALID [2022-04-28 08:48:18,147 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-28 08:48:18,147 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-28 08:48:18,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {80367#true} assume true; {80367#true} is VALID [2022-04-28 08:48:18,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80367#true} {80367#true} #710#return; {80367#true} is VALID [2022-04-28 08:48:18,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {80367#true} call #t~ret161 := main(); {80367#true} is VALID [2022-04-28 08:48:18,147 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {80367#true} assume !false; {80367#true} is VALID [2022-04-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,148 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-28 08:48:18,149 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-28 08:48:18,149 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-28 08:48:18,149 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-28 08:48:18,149 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-28 08:48:18,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {80367#true} assume 8464 == #t~mem55;havoc #t~mem55; {80367#true} is VALID [2022-04-28 08:48:18,149 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-28 08:48:18,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {80367#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {80367#true} is VALID [2022-04-28 08:48:18,150 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-28 08:48:18,150 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-28 08:48:18,151 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-28 08:48:18,151 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-28 08:48:18,152 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-28 08:48:18,152 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-28 08:48:18,152 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-28 08:48:18,153 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-28 08:48:18,153 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-28 08:48:18,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {80368#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {80368#false} is VALID [2022-04-28 08:48:18,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {80368#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {80368#false} is VALID [2022-04-28 08:48:18,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {80368#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {80368#false} is VALID [2022-04-28 08:48:18,153 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-28 08:48:18,153 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-28 08:48:18,153 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-28 08:48:18,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {80368#false} assume 12292 != #t~mem85;havoc #t~mem85; {80368#false} is VALID [2022-04-28 08:48:18,153 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {80368#false} ~skip~0 := 0; {80368#false} is VALID [2022-04-28 08:48:18,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {80368#false} assume !false; {80368#false} is VALID [2022-04-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,154 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,155 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-28 08:48:18,156 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-28 08:48:18,156 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-28 08:48:18,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {80368#false} assume 8608 == #t~mem73;havoc #t~mem73; {80368#false} is VALID [2022-04-28 08:48:18,156 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-28 08:48:18,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {80368#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {80368#false} is VALID [2022-04-28 08:48:18,156 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-28 08:48:18,156 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-28 08:48:18,156 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-28 08:48:18,156 INFO L290 TraceCheckUtils]: 81: Hoare triple {80368#false} ~skip~0 := 0; {80368#false} is VALID [2022-04-28 08:48:18,156 INFO L290 TraceCheckUtils]: 82: Hoare triple {80368#false} assume !false; {80368#false} is VALID [2022-04-28 08:48:18,156 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-28 08:48:18,156 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-28 08:48:18,156 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-28 08:48:18,156 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,157 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 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-28 08:48:18,158 INFO L290 TraceCheckUtils]: 112: Hoare triple {80368#false} assume 8640 == #t~mem75;havoc #t~mem75; {80368#false} is VALID [2022-04-28 08:48:18,158 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-28 08:48:18,158 INFO L290 TraceCheckUtils]: 114: Hoare triple {80368#false} assume !(9 == ~blastFlag~0); {80368#false} is VALID [2022-04-28 08:48:18,159 INFO L290 TraceCheckUtils]: 115: Hoare triple {80368#false} assume 12 == ~blastFlag~0; {80368#false} is VALID [2022-04-28 08:48:18,159 INFO L290 TraceCheckUtils]: 116: Hoare triple {80368#false} assume !false; {80368#false} is VALID [2022-04-28 08:48:18,159 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-28 08:48:18,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:48:18,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72177676] [2022-04-28 08:48:18,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72177676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:18,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:18,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:18,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:48:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843078531] [2022-04-28 08:48:18,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843078531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:18,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:18,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029267340] [2022-04-28 08:48:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:48:18,161 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-28 08:48:18,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:48:18,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:18,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:18,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:48:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:48:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:48:18,223 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-28 08:48:22,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:24,328 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-28 08:48:26,385 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-28 08:48:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:29,978 INFO L93 Difference]: Finished difference Result 1792 states and 2858 transitions. [2022-04-28 08:48:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:48:29,979 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-28 08:48:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:48:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-28 08:48:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-28 08:48:29,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 613 transitions. [2022-04-28 08:48:30,386 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-28 08:48:30,436 INFO L225 Difference]: With dead ends: 1792 [2022-04-28 08:48:30,436 INFO L226 Difference]: Without dead ends: 1166 [2022-04-28 08:48:30,437 INFO L412 NwaCegarLoop]: 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-28 08:48:30,437 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 62 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:48:30,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 374 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 487 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-04-28 08:48:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-04-28 08:48:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 912. [2022-04-28 08:48:30,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:48:30,470 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-28 08:48:30,470 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-28 08:48:30,471 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-28 08:48:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:30,504 INFO L93 Difference]: Finished difference Result 1166 states and 1818 transitions. [2022-04-28 08:48:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1818 transitions. [2022-04-28 08:48:30,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:30,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:30,506 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-28 08:48:30,507 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-28 08:48:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:30,540 INFO L93 Difference]: Finished difference Result 1166 states and 1818 transitions. [2022-04-28 08:48:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1818 transitions. [2022-04-28 08:48:30,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:30,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:30,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:48:30,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:48:30,542 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-28 08:48:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1477 transitions. [2022-04-28 08:48:30,573 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1477 transitions. Word has length 117 [2022-04-28 08:48:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:48:30,573 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1477 transitions. [2022-04-28 08:48:30,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:30,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1477 transitions. [2022-04-28 08:48:33,852 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-28 08:48:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1477 transitions. [2022-04-28 08:48:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 08:48:33,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:48:33,854 INFO L195 NwaCegarLoop]: 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-28 08:48:33,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:48:33,854 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:48:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:48:33,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1958971758, now seen corresponding path program 1 times [2022-04-28 08:48:33,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:33,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389401920] [2022-04-28 08:48:33,945 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:48:33,945 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:48:33,945 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:48:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1958971758, now seen corresponding path program 2 times [2022-04-28 08:48:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:48:33,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592775248] [2022-04-28 08:48:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:48:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:48:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:48:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:34,098 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-28 08:48:34,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {88119#true} assume true; {88119#true} is VALID [2022-04-28 08:48:34,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88119#true} {88119#true} #710#return; {88119#true} is VALID [2022-04-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {88119#true} assume true; {88119#true} is VALID [2022-04-28 08:48:34,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88119#true} {88119#true} #710#return; {88119#true} is VALID [2022-04-28 08:48:34,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {88119#true} call #t~ret161 := main(); {88119#true} is VALID [2022-04-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,099 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-28 08:48:34,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {88119#true} assume !false; {88119#true} is VALID [2022-04-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 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-28 08:48:34,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {88119#true} assume 8464 == #t~mem55;havoc #t~mem55; {88119#true} is VALID [2022-04-28 08:48:34,100 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-28 08:48:34,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {88119#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {88119#true} is VALID [2022-04-28 08:48:34,101 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-28 08:48:34,102 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-28 08:48:34,102 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-28 08:48:34,103 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-28 08:48:34,103 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-28 08:48:34,103 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-28 08:48:34,104 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-28 08:48:34,104 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-28 08:48:34,104 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-28 08:48:34,105 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-28 08:48:34,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {88120#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {88120#false} is VALID [2022-04-28 08:48:34,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {88120#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {88120#false} is VALID [2022-04-28 08:48:34,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {88120#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {88120#false} is VALID [2022-04-28 08:48:34,105 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-28 08:48:34,105 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-28 08:48:34,105 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-28 08:48:34,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {88120#false} assume 12292 != #t~mem85;havoc #t~mem85; {88120#false} is VALID [2022-04-28 08:48:34,105 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-28 08:48:34,105 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-28 08:48:34,105 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-28 08:48:34,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {88120#false} ~skip~0 := 0; {88120#false} is VALID [2022-04-28 08:48:34,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {88120#false} assume !false; {88120#false} is VALID [2022-04-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,106 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 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-28 08:48:34,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {88120#false} assume 8608 == #t~mem73;havoc #t~mem73; {88120#false} is VALID [2022-04-28 08:48:34,107 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-28 08:48:34,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {88120#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {88120#false} is VALID [2022-04-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 INFO L290 TraceCheckUtils]: 82: Hoare triple {88120#false} ~skip~0 := 0; {88120#false} is VALID [2022-04-28 08:48:34,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {88120#false} assume !false; {88120#false} is VALID [2022-04-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,108 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,109 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-28 08:48:34,110 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-28 08:48:34,110 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-28 08:48:34,110 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-28 08:48:34,110 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-28 08:48:34,110 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-28 08:48:34,110 INFO L290 TraceCheckUtils]: 113: Hoare triple {88120#false} assume 8640 == #t~mem75;havoc #t~mem75; {88120#false} is VALID [2022-04-28 08:48:34,110 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-28 08:48:34,110 INFO L290 TraceCheckUtils]: 115: Hoare triple {88120#false} assume !(9 == ~blastFlag~0); {88120#false} is VALID [2022-04-28 08:48:34,110 INFO L290 TraceCheckUtils]: 116: Hoare triple {88120#false} assume 12 == ~blastFlag~0; {88120#false} is VALID [2022-04-28 08:48:34,110 INFO L290 TraceCheckUtils]: 117: Hoare triple {88120#false} assume !false; {88120#false} is VALID [2022-04-28 08:48:34,110 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-28 08:48:34,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:48:34,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592775248] [2022-04-28 08:48:34,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592775248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:34,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:34,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:34,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:48:34,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389401920] [2022-04-28 08:48:34,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389401920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:34,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:34,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:34,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525746403] [2022-04-28 08:48:34,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:48:34,112 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-28 08:48:34,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:48:34,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:34,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:48:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:34,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:48:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:48:34,185 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-28 08:48:36,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:38,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:41,022 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-28 08:48:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:47,447 INFO L93 Difference]: Finished difference Result 1260 states and 2037 transitions. [2022-04-28 08:48:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:48:47,447 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-28 08:48:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:48:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:48:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:48:47,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 08:48:47,734 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-28 08:48:47,768 INFO L225 Difference]: With dead ends: 1260 [2022-04-28 08:48:47,768 INFO L226 Difference]: Without dead ends: 939 [2022-04-28 08:48:47,769 INFO L412 NwaCegarLoop]: 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-28 08:48:47,769 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 36 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:48:47,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 605 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 438 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 08:48:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-04-28 08:48:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 912. [2022-04-28 08:48:47,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:48:47,808 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-28 08:48:47,809 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-28 08:48:47,809 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-28 08:48:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:47,833 INFO L93 Difference]: Finished difference Result 939 states and 1511 transitions. [2022-04-28 08:48:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1511 transitions. [2022-04-28 08:48:47,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:47,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:47,834 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-28 08:48:47,835 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-28 08:48:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:47,859 INFO L93 Difference]: Finished difference Result 939 states and 1511 transitions. [2022-04-28 08:48:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1511 transitions. [2022-04-28 08:48:47,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:47,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:47,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:48:47,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:48:47,861 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-28 08:48:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1476 transitions. [2022-04-28 08:48:47,892 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1476 transitions. Word has length 118 [2022-04-28 08:48:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:48:47,892 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1476 transitions. [2022-04-28 08:48:47,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:47,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1476 transitions. [2022-04-28 08:48:51,184 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-28 08:48:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1476 transitions. [2022-04-28 08:48:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 08:48:51,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:48:51,185 INFO L195 NwaCegarLoop]: 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-28 08:48:51,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:48:51,186 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:48:51,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:48:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash -797369959, now seen corresponding path program 1 times [2022-04-28 08:48:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:51,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1697136809] [2022-04-28 08:48:51,249 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:48:51,249 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:48:51,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:48:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -797369959, now seen corresponding path program 2 times [2022-04-28 08:48:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:48:51,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56846037] [2022-04-28 08:48:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:48:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:48:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:48:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:51,403 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-28 08:48:51,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {94353#true} assume true; {94353#true} is VALID [2022-04-28 08:48:51,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94353#true} {94353#true} #710#return; {94353#true} is VALID [2022-04-28 08:48:51,404 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-28 08:48:51,404 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-28 08:48:51,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {94353#true} assume true; {94353#true} is VALID [2022-04-28 08:48:51,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94353#true} {94353#true} #710#return; {94353#true} is VALID [2022-04-28 08:48:51,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {94353#true} call #t~ret161 := main(); {94353#true} is VALID [2022-04-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 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-28 08:48:51,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {94353#true} assume !false; {94353#true} is VALID [2022-04-28 08:48:51,405 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-28 08:48:51,406 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-28 08:48:51,406 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-28 08:48:51,406 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-28 08:48:51,406 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-28 08:48:51,406 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-28 08:48:51,406 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-28 08:48:51,406 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-28 08:48:51,406 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-28 08:48:51,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {94353#true} assume 8464 == #t~mem55;havoc #t~mem55; {94353#true} is VALID [2022-04-28 08:48:51,406 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-28 08:48:51,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {94353#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {94353#true} is VALID [2022-04-28 08:48:51,407 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-28 08:48:51,408 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-28 08:48:51,408 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-28 08:48:51,411 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-28 08:48:51,411 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-28 08:48:51,412 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-28 08:48:51,412 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-28 08:48:51,412 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-28 08:48:51,413 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-28 08:48:51,413 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-28 08:48:51,414 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-28 08:48:51,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {94354#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {94354#false} is VALID [2022-04-28 08:48:51,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {94354#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {94354#false} is VALID [2022-04-28 08:48:51,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {94354#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {94354#false} is VALID [2022-04-28 08:48:51,414 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-28 08:48:51,414 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-28 08:48:51,414 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-28 08:48:51,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {94354#false} assume 12292 != #t~mem85;havoc #t~mem85; {94354#false} is VALID [2022-04-28 08:48:51,414 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-28 08:48:51,414 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-28 08:48:51,414 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-28 08:48:51,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {94354#false} ~skip~0 := 0; {94354#false} is VALID [2022-04-28 08:48:51,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {94354#false} assume !false; {94354#false} is VALID [2022-04-28 08:48:51,414 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,415 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 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-28 08:48:51,416 INFO L290 TraceCheckUtils]: 77: Hoare triple {94354#false} assume 8608 == #t~mem73;havoc #t~mem73; {94354#false} is VALID [2022-04-28 08:48:51,416 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-28 08:48:51,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {94354#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {94354#false} is VALID [2022-04-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {94354#false} ~skip~0 := 0; {94354#false} is VALID [2022-04-28 08:48:51,417 INFO L290 TraceCheckUtils]: 84: Hoare triple {94354#false} assume !false; {94354#false} is VALID [2022-04-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,417 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,418 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-28 08:48:51,419 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-28 08:48:51,419 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-28 08:48:51,419 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-28 08:48:51,419 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-28 08:48:51,419 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-28 08:48:51,419 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-28 08:48:51,419 INFO L290 TraceCheckUtils]: 114: Hoare triple {94354#false} assume 8640 == #t~mem75;havoc #t~mem75; {94354#false} is VALID [2022-04-28 08:48:51,419 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-28 08:48:51,419 INFO L290 TraceCheckUtils]: 116: Hoare triple {94354#false} assume !(9 == ~blastFlag~0); {94354#false} is VALID [2022-04-28 08:48:51,419 INFO L290 TraceCheckUtils]: 117: Hoare triple {94354#false} assume 12 == ~blastFlag~0; {94354#false} is VALID [2022-04-28 08:48:51,419 INFO L290 TraceCheckUtils]: 118: Hoare triple {94354#false} assume !false; {94354#false} is VALID [2022-04-28 08:48:51,420 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-28 08:48:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:48:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56846037] [2022-04-28 08:48:51,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56846037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:51,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:51,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:51,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:48:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1697136809] [2022-04-28 08:48:51,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1697136809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:51,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:51,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:48:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515264348] [2022-04-28 08:48:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:48:51,421 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-28 08:48:51,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:48:51,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:51,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:51,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:48:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:48:51,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:48:51,482 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-28 08:49:00,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:04,505 INFO L93 Difference]: Finished difference Result 1250 states and 2022 transitions. [2022-04-28 08:49:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:49:04,505 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-28 08:49:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:49:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-28 08:49:04,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-28 08:49:04,798 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-28 08:49:04,832 INFO L225 Difference]: With dead ends: 1250 [2022-04-28 08:49:04,833 INFO L226 Difference]: Without dead ends: 929 [2022-04-28 08:49:04,833 INFO L412 NwaCegarLoop]: 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-28 08:49:04,833 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 33 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s 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, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:04,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 601 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 433 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 08:49:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-04-28 08:49:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 912. [2022-04-28 08:49:04,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:04,865 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-28 08:49:04,865 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-28 08:49:04,866 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-28 08:49:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:04,890 INFO L93 Difference]: Finished difference Result 929 states and 1497 transitions. [2022-04-28 08:49:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1497 transitions. [2022-04-28 08:49:04,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:04,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:04,892 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-28 08:49:04,892 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-28 08:49:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:04,916 INFO L93 Difference]: Finished difference Result 929 states and 1497 transitions. [2022-04-28 08:49:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1497 transitions. [2022-04-28 08:49:04,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:04,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:04,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:04,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:04,918 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-28 08:49:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1475 transitions. [2022-04-28 08:49:04,949 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1475 transitions. Word has length 119 [2022-04-28 08:49:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:04,949 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1475 transitions. [2022-04-28 08:49:04,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:04,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1475 transitions. [2022-04-28 08:49:08,298 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-28 08:49:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1475 transitions. [2022-04-28 08:49:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 08:49:08,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:08,300 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:49:08,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:49:08,300 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -158828971, now seen corresponding path program 1 times [2022-04-28 08:49:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:08,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1683941254] [2022-04-28 08:49:08,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:08,364 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:08,364 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash -158828971, now seen corresponding path program 2 times [2022-04-28 08:49:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:08,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381297364] [2022-04-28 08:49:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:08,516 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-28 08:49:08,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {100547#true} assume true; {100547#true} is VALID [2022-04-28 08:49:08,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100547#true} {100547#true} #710#return; {100547#true} is VALID [2022-04-28 08:49:08,517 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-28 08:49:08,517 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-28 08:49:08,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {100547#true} assume true; {100547#true} is VALID [2022-04-28 08:49:08,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100547#true} {100547#true} #710#return; {100547#true} is VALID [2022-04-28 08:49:08,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {100547#true} call #t~ret161 := main(); {100547#true} is VALID [2022-04-28 08:49:08,517 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-28 08:49:08,517 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-28 08:49:08,517 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-28 08:49:08,517 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {100547#true} assume !false; {100547#true} is VALID [2022-04-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,518 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-28 08:49:08,519 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-28 08:49:08,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {100547#true} assume 8464 == #t~mem55;havoc #t~mem55; {100547#true} is VALID [2022-04-28 08:49:08,519 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-28 08:49:08,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {100547#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {100547#true} is VALID [2022-04-28 08:49:08,520 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-28 08:49:08,520 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-28 08:49:08,521 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-28 08:49:08,521 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-28 08:49:08,521 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-28 08:49:08,522 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-28 08:49:08,522 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-28 08:49:08,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {100548#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {100548#false} is VALID [2022-04-28 08:49:08,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {100548#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {100548#false} is VALID [2022-04-28 08:49:08,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {100548#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {100548#false} is VALID [2022-04-28 08:49:08,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {100548#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {100548#false} is VALID [2022-04-28 08:49:08,522 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-28 08:49:08,522 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-28 08:49:08,522 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-28 08:49:08,522 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-28 08:49:08,522 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-28 08:49:08,523 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-28 08:49:08,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {100548#false} ~skip~0 := 0; {100548#false} is VALID [2022-04-28 08:49:08,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {100548#false} assume 8480 == #t~mem52;havoc #t~mem52; {100548#false} is VALID [2022-04-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,523 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-28 08:49:08,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {100548#false} ~skip~0 := 0; {100548#false} is VALID [2022-04-28 08:49:08,524 INFO L290 TraceCheckUtils]: 58: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,524 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-28 08:49:08,525 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-28 08:49:08,526 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-28 08:49:08,526 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-28 08:49:08,526 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-28 08:49:08,526 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-28 08:49:08,526 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-28 08:49:08,526 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-28 08:49:08,526 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-28 08:49:08,526 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-28 08:49:08,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {100548#false} assume 8448 == #t~mem68;havoc #t~mem68; {100548#false} is VALID [2022-04-28 08:49:08,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {100548#false} assume !(~num1~0 > 0); {100548#false} is VALID [2022-04-28 08:49:08,527 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-28 08:49:08,527 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-28 08:49:08,527 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-28 08:49:08,527 INFO L290 TraceCheckUtils]: 86: Hoare triple {100548#false} ~skip~0 := 0; {100548#false} is VALID [2022-04-28 08:49:08,527 INFO L290 TraceCheckUtils]: 87: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-28 08:49:08,527 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-28 08:49:08,527 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-28 08:49:08,527 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,528 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,529 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-28 08:49:08,530 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-28 08:49:08,530 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-28 08:49:08,530 INFO L290 TraceCheckUtils]: 117: Hoare triple {100548#false} assume 8640 == #t~mem75;havoc #t~mem75; {100548#false} is VALID [2022-04-28 08:49:08,530 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-28 08:49:08,535 INFO L290 TraceCheckUtils]: 119: Hoare triple {100548#false} assume !(9 == ~blastFlag~0); {100548#false} is VALID [2022-04-28 08:49:08,535 INFO L290 TraceCheckUtils]: 120: Hoare triple {100548#false} assume 12 == ~blastFlag~0; {100548#false} is VALID [2022-04-28 08:49:08,535 INFO L290 TraceCheckUtils]: 121: Hoare triple {100548#false} assume !false; {100548#false} is VALID [2022-04-28 08:49:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 08:49:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:08,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381297364] [2022-04-28 08:49:08,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381297364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:08,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:08,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:08,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:08,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1683941254] [2022-04-28 08:49:08,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1683941254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:08,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:08,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207404588] [2022-04-28 08:49:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:08,536 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-28 08:49:08,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:08,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:08,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:08,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:08,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:08,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:08,593 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-28 08:49:10,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:12,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:17,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:21,209 INFO L93 Difference]: Finished difference Result 1770 states and 2801 transitions. [2022-04-28 08:49:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:49:21,210 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-28 08:49:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-28 08:49:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2022-04-28 08:49:21,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 611 transitions. [2022-04-28 08:49:21,594 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-28 08:49:21,643 INFO L225 Difference]: With dead ends: 1770 [2022-04-28 08:49:21,643 INFO L226 Difference]: Without dead ends: 1146 [2022-04-28 08:49:21,644 INFO L412 NwaCegarLoop]: 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-28 08:49:21,644 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 156 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s 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, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:21,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 376 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 08:49:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-04-28 08:49:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 912. [2022-04-28 08:49:21,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:21,679 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-28 08:49:21,679 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-28 08:49:21,680 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-28 08:49:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:21,712 INFO L93 Difference]: Finished difference Result 1146 states and 1777 transitions. [2022-04-28 08:49:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1777 transitions. [2022-04-28 08:49:21,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:21,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:21,714 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-28 08:49:21,714 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-28 08:49:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:21,747 INFO L93 Difference]: Finished difference Result 1146 states and 1777 transitions. [2022-04-28 08:49:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1777 transitions. [2022-04-28 08:49:21,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:21,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:21,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:21,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:21,749 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-28 08:49:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1460 transitions. [2022-04-28 08:49:21,789 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1460 transitions. Word has length 122 [2022-04-28 08:49:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:21,789 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1460 transitions. [2022-04-28 08:49:21,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:21,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 912 states and 1460 transitions. [2022-04-28 08:49:25,062 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-28 08:49:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1460 transitions. [2022-04-28 08:49:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 08:49:25,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:25,064 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:49:25,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:49:25,064 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1699899791, now seen corresponding path program 1 times [2022-04-28 08:49:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:25,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [72506347] [2022-04-28 08:49:25,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:25,133 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:25,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1699899791, now seen corresponding path program 2 times [2022-04-28 08:49:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:25,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762089776] [2022-04-28 08:49:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:25,296 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-28 08:49:25,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {108215#true} assume true; {108215#true} is VALID [2022-04-28 08:49:25,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108215#true} {108215#true} #710#return; {108215#true} is VALID [2022-04-28 08:49:25,297 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-28 08:49:25,297 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-28 08:49:25,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {108215#true} assume true; {108215#true} is VALID [2022-04-28 08:49:25,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108215#true} {108215#true} #710#return; {108215#true} is VALID [2022-04-28 08:49:25,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {108215#true} call #t~ret161 := main(); {108215#true} is VALID [2022-04-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {108215#true} assume !false; {108215#true} is VALID [2022-04-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,298 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-28 08:49:25,299 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-28 08:49:25,299 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-28 08:49:25,299 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-28 08:49:25,299 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-28 08:49:25,299 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-28 08:49:25,299 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-28 08:49:25,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {108215#true} assume 8464 == #t~mem55;havoc #t~mem55; {108215#true} is VALID [2022-04-28 08:49:25,299 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-28 08:49:25,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {108215#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {108215#true} is VALID [2022-04-28 08:49:25,299 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-28 08:49:25,299 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-28 08:49:25,299 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-28 08:49:25,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {108215#true} ~skip~0 := 0; {108215#true} is VALID [2022-04-28 08:49:25,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {108215#true} assume !false; {108215#true} is VALID [2022-04-28 08:49:25,299 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 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-28 08:49:25,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {108215#true} assume 8496 == #t~mem58;havoc #t~mem58; {108215#true} is VALID [2022-04-28 08:49:25,300 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-28 08:49:25,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {108215#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {108215#true} is VALID [2022-04-28 08:49:25,301 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-28 08:49:25,301 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-28 08:49:25,302 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-28 08:49:25,302 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-28 08:49:25,303 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-28 08:49:25,303 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-28 08:49:25,303 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-28 08:49:25,304 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-28 08:49:25,304 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-28 08:49:25,305 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-28 08:49:25,305 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-28 08:49:25,305 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-28 08:49:25,306 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-28 08:49:25,306 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-28 08:49:25,306 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-28 08:49:25,307 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-28 08:49:25,307 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-28 08:49:25,307 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-28 08:49:25,308 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-28 08:49:25,308 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-28 08:49:25,308 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-28 08:49:25,309 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-28 08:49:25,309 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-28 08:49:25,309 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-28 08:49:25,310 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-28 08:49:25,310 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-28 08:49:25,310 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-28 08:49:25,311 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-28 08:49:25,311 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-28 08:49:25,311 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-28 08:49:25,312 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-28 08:49:25,312 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-28 08:49:25,312 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-28 08:49:25,313 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-28 08:49:25,313 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-28 08:49:25,313 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-28 08:49:25,313 INFO L290 TraceCheckUtils]: 83: Hoare triple {108216#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {108216#false} is VALID [2022-04-28 08:49:25,313 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-28 08:49:25,313 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-28 08:49:25,313 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-28 08:49:25,314 INFO L290 TraceCheckUtils]: 87: Hoare triple {108216#false} ~skip~0 := 0; {108216#false} is VALID [2022-04-28 08:49:25,314 INFO L290 TraceCheckUtils]: 88: Hoare triple {108216#false} assume !false; {108216#false} is VALID [2022-04-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,314 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,315 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-28 08:49:25,316 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-28 08:49:25,316 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-28 08:49:25,316 INFO L290 TraceCheckUtils]: 118: Hoare triple {108216#false} assume 8640 == #t~mem75;havoc #t~mem75; {108216#false} is VALID [2022-04-28 08:49:25,316 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-28 08:49:25,316 INFO L290 TraceCheckUtils]: 120: Hoare triple {108216#false} assume !(9 == ~blastFlag~0); {108216#false} is VALID [2022-04-28 08:49:25,316 INFO L290 TraceCheckUtils]: 121: Hoare triple {108216#false} assume 12 == ~blastFlag~0; {108216#false} is VALID [2022-04-28 08:49:25,316 INFO L290 TraceCheckUtils]: 122: Hoare triple {108216#false} assume !false; {108216#false} is VALID [2022-04-28 08:49:25,316 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-28 08:49:25,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762089776] [2022-04-28 08:49:25,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762089776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:25,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:25,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:25,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:25,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [72506347] [2022-04-28 08:49:25,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [72506347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:25,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:25,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671473726] [2022-04-28 08:49:25,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:25,318 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-28 08:49:25,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:25,318 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-28 08:49:25,391 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-28 08:49:25,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:25,391 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-28 08:49:29,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:31,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:33,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:35,721 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-28 08:49:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:39,328 INFO L93 Difference]: Finished difference Result 2152 states and 3410 transitions. [2022-04-28 08:49:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:49:39,328 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-28 08:49:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:39,329 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-28 08:49:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:49:39,331 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-28 08:49:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:49:39,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-28 08:49:39,711 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-28 08:49:39,769 INFO L225 Difference]: With dead ends: 2152 [2022-04-28 08:49:39,769 INFO L226 Difference]: Without dead ends: 1266 [2022-04-28 08:49:39,770 INFO L412 NwaCegarLoop]: 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-28 08:49:39,770 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 129 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 58 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:39,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 376 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 487 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2022-04-28 08:49:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-04-28 08:49:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1023. [2022-04-28 08:49:39,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:39,812 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-28 08:49:39,812 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-28 08:49:39,813 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-28 08:49:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:39,851 INFO L93 Difference]: Finished difference Result 1266 states and 1978 transitions. [2022-04-28 08:49:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1978 transitions. [2022-04-28 08:49:39,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:39,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:39,852 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-28 08:49:39,853 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-28 08:49:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:39,891 INFO L93 Difference]: Finished difference Result 1266 states and 1978 transitions. [2022-04-28 08:49:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1978 transitions. [2022-04-28 08:49:39,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:39,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:39,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:39,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:39,893 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-28 08:49:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1649 transitions. [2022-04-28 08:49:39,931 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1649 transitions. Word has length 123 [2022-04-28 08:49:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:39,931 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1649 transitions. [2022-04-28 08:49:39,931 INFO L496 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-28 08:49:39,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1649 transitions. [2022-04-28 08:49:43,423 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-28 08:49:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1649 transitions. [2022-04-28 08:49:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 08:49:43,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:43,425 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:49:43,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:49:43,425 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:43,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash 287066353, now seen corresponding path program 1 times [2022-04-28 08:49:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:43,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990788006] [2022-04-28 08:49:43,483 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:43,483 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:43,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash 287066353, now seen corresponding path program 2 times [2022-04-28 08:49:43,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:43,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517760237] [2022-04-28 08:49:43,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:43,673 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-28 08:49:43,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {117109#true} assume true; {117109#true} is VALID [2022-04-28 08:49:43,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117109#true} {117109#true} #710#return; {117109#true} is VALID [2022-04-28 08:49:43,674 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-28 08:49:43,674 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-28 08:49:43,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {117109#true} assume true; {117109#true} is VALID [2022-04-28 08:49:43,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117109#true} {117109#true} #710#return; {117109#true} is VALID [2022-04-28 08:49:43,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {117109#true} call #t~ret161 := main(); {117109#true} is VALID [2022-04-28 08:49:43,674 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {117109#true} assume !false; {117109#true} is VALID [2022-04-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,675 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-28 08:49:43,676 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-28 08:49:43,676 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-28 08:49:43,676 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-28 08:49:43,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {117109#true} assume 8464 == #t~mem55;havoc #t~mem55; {117109#true} is VALID [2022-04-28 08:49:43,676 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-28 08:49:43,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {117109#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {117109#true} is VALID [2022-04-28 08:49:43,676 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-28 08:49:43,676 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-28 08:49:43,676 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-28 08:49:43,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {117109#true} ~skip~0 := 0; {117109#true} is VALID [2022-04-28 08:49:43,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {117109#true} assume !false; {117109#true} is VALID [2022-04-28 08:49:43,676 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-28 08:49:43,676 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-28 08:49:43,676 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-28 08:49:43,676 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-28 08:49:43,677 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-28 08:49:43,677 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-28 08:49:43,677 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-28 08:49:43,677 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-28 08:49:43,677 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-28 08:49:43,677 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-28 08:49:43,677 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-28 08:49:43,677 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-28 08:49:43,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {117109#true} assume 8496 == #t~mem58;havoc #t~mem58; {117109#true} is VALID [2022-04-28 08:49:43,677 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-28 08:49:43,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {117109#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {117109#true} is VALID [2022-04-28 08:49:43,677 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-28 08:49:43,678 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-28 08:49:43,679 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-28 08:49:43,679 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-28 08:49:43,680 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-28 08:49:43,680 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-28 08:49:43,680 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-28 08:49:43,681 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-28 08:49:43,681 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-28 08:49:43,681 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-28 08:49:43,682 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-28 08:49:43,682 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-28 08:49:43,682 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-28 08:49:43,683 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-28 08:49:43,683 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-28 08:49:43,683 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-28 08:49:43,684 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-28 08:49:43,684 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-28 08:49:43,684 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-28 08:49:43,685 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-28 08:49:43,685 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-28 08:49:43,685 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-28 08:49:43,686 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-28 08:49:43,686 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-28 08:49:43,686 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-28 08:49:43,687 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-28 08:49:43,687 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-28 08:49:43,687 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-28 08:49:43,688 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-28 08:49:43,688 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-28 08:49:43,688 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-28 08:49:43,689 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-28 08:49:43,689 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-28 08:49:43,690 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-28 08:49:43,690 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-28 08:49:43,690 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-28 08:49:43,690 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-28 08:49:43,690 INFO L290 TraceCheckUtils]: 84: Hoare triple {117110#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {117110#false} is VALID [2022-04-28 08:49:43,690 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-28 08:49:43,690 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-28 08:49:43,691 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-28 08:49:43,691 INFO L290 TraceCheckUtils]: 88: Hoare triple {117110#false} ~skip~0 := 0; {117110#false} is VALID [2022-04-28 08:49:43,691 INFO L290 TraceCheckUtils]: 89: Hoare triple {117110#false} assume !false; {117110#false} is VALID [2022-04-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,691 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,692 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-28 08:49:43,693 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-28 08:49:43,693 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-28 08:49:43,693 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-28 08:49:43,693 INFO L290 TraceCheckUtils]: 119: Hoare triple {117110#false} assume 8640 == #t~mem75;havoc #t~mem75; {117110#false} is VALID [2022-04-28 08:49:43,693 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-28 08:49:43,693 INFO L290 TraceCheckUtils]: 121: Hoare triple {117110#false} assume !(9 == ~blastFlag~0); {117110#false} is VALID [2022-04-28 08:49:43,693 INFO L290 TraceCheckUtils]: 122: Hoare triple {117110#false} assume 12 == ~blastFlag~0; {117110#false} is VALID [2022-04-28 08:49:43,693 INFO L290 TraceCheckUtils]: 123: Hoare triple {117110#false} assume !false; {117110#false} is VALID [2022-04-28 08:49:43,693 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-28 08:49:43,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517760237] [2022-04-28 08:49:43,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517760237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:43,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:43,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:43,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:43,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990788006] [2022-04-28 08:49:43,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990788006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:43,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:43,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505669513] [2022-04-28 08:49:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:43,695 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-28 08:49:43,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:43,695 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-28 08:49:43,766 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-28 08:49:43,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:43,767 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-28 08:49:48,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:55,334 INFO L93 Difference]: Finished difference Result 2254 states and 3581 transitions. [2022-04-28 08:49:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:49:55,334 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-28 08:49:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:55,334 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-28 08:49:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:49:55,336 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-28 08:49:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:49:55,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-28 08:49:55,733 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-28 08:49:55,792 INFO L225 Difference]: With dead ends: 2254 [2022-04-28 08:49:55,792 INFO L226 Difference]: Without dead ends: 1257 [2022-04-28 08:49:55,793 INFO L412 NwaCegarLoop]: 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-28 08:49:55,793 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 128 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:55,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 390 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 494 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 08:49:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-04-28 08:49:55,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1023. [2022-04-28 08:49:55,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:55,838 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-28 08:49:55,839 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-28 08:49:55,839 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-28 08:49:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:55,877 INFO L93 Difference]: Finished difference Result 1257 states and 1960 transitions. [2022-04-28 08:49:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1960 transitions. [2022-04-28 08:49:55,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:55,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:55,878 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-28 08:49:55,879 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-28 08:49:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:55,917 INFO L93 Difference]: Finished difference Result 1257 states and 1960 transitions. [2022-04-28 08:49:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1960 transitions. [2022-04-28 08:49:55,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:55,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:55,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:55,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:55,919 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-28 08:49:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1643 transitions. [2022-04-28 08:49:55,966 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1643 transitions. Word has length 124 [2022-04-28 08:49:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:55,966 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1643 transitions. [2022-04-28 08:49:55,966 INFO L496 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-28 08:49:55,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1643 transitions. [2022-04-28 08:49:59,524 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-28 08:49:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1643 transitions. [2022-04-28 08:49:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 08:49:59,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:59,525 INFO L195 NwaCegarLoop]: 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-28 08:49:59,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:49:59,526 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1572502022, now seen corresponding path program 1 times [2022-04-28 08:49:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:59,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882900430] [2022-04-28 08:49:59,584 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:59,584 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:59,585 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1572502022, now seen corresponding path program 2 times [2022-04-28 08:49:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:59,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412449840] [2022-04-28 08:49:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:59,761 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-28 08:49:59,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {126189#true} assume true; {126189#true} is VALID [2022-04-28 08:49:59,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126189#true} {126189#true} #710#return; {126189#true} is VALID [2022-04-28 08:49:59,762 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-28 08:49:59,762 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-28 08:49:59,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {126189#true} assume true; {126189#true} is VALID [2022-04-28 08:49:59,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126189#true} {126189#true} #710#return; {126189#true} is VALID [2022-04-28 08:49:59,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {126189#true} call #t~ret161 := main(); {126189#true} is VALID [2022-04-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {126189#true} assume !false; {126189#true} is VALID [2022-04-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,763 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-28 08:49:59,764 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-28 08:49:59,764 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-28 08:49:59,764 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-28 08:49:59,764 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-28 08:49:59,764 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-28 08:49:59,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {126189#true} assume 8464 == #t~mem55;havoc #t~mem55; {126189#true} is VALID [2022-04-28 08:49:59,764 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-28 08:49:59,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {126189#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {126189#true} is VALID [2022-04-28 08:49:59,764 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-28 08:49:59,764 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-28 08:49:59,764 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-28 08:49:59,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {126189#true} ~skip~0 := 0; {126189#true} is VALID [2022-04-28 08:49:59,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {126189#true} assume !false; {126189#true} is VALID [2022-04-28 08:49:59,764 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 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-28 08:49:59,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {126189#true} assume 8496 == #t~mem58;havoc #t~mem58; {126189#true} is VALID [2022-04-28 08:49:59,765 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-28 08:49:59,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {126189#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {126189#true} is VALID [2022-04-28 08:49:59,765 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-28 08:49:59,766 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-28 08:49:59,767 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-28 08:49:59,767 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-28 08:49:59,768 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-28 08:49:59,768 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-28 08:49:59,768 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-28 08:49:59,769 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-28 08:49:59,769 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-28 08:49:59,769 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-28 08:49:59,770 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-28 08:49:59,770 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-28 08:49:59,771 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-28 08:49:59,771 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-28 08:49:59,771 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-28 08:49:59,771 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-28 08:49:59,771 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-28 08:49:59,771 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-28 08:49:59,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {126190#false} ~skip~0 := 0; {126190#false} is VALID [2022-04-28 08:49:59,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {126190#false} assume !false; {126190#false} is VALID [2022-04-28 08:49:59,771 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-28 08:49:59,771 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-28 08:49:59,771 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,772 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-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,773 INFO L290 TraceCheckUtils]: 89: Hoare triple {126190#false} assume 8448 == #t~mem68;havoc #t~mem68; {126190#false} is VALID [2022-04-28 08:49:59,773 INFO L290 TraceCheckUtils]: 90: Hoare triple {126190#false} assume !(~num1~0 > 0); {126190#false} is VALID [2022-04-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,773 INFO L290 TraceCheckUtils]: 94: Hoare triple {126190#false} ~skip~0 := 0; {126190#false} is VALID [2022-04-28 08:49:59,773 INFO L290 TraceCheckUtils]: 95: Hoare triple {126190#false} assume !false; {126190#false} is VALID [2022-04-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,773 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,774 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 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-28 08:49:59,775 INFO L290 TraceCheckUtils]: 125: Hoare triple {126190#false} assume 8640 == #t~mem75;havoc #t~mem75; {126190#false} is VALID [2022-04-28 08:49:59,775 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-28 08:49:59,775 INFO L290 TraceCheckUtils]: 127: Hoare triple {126190#false} assume !(9 == ~blastFlag~0); {126190#false} is VALID [2022-04-28 08:49:59,775 INFO L290 TraceCheckUtils]: 128: Hoare triple {126190#false} assume 12 == ~blastFlag~0; {126190#false} is VALID [2022-04-28 08:49:59,775 INFO L290 TraceCheckUtils]: 129: Hoare triple {126190#false} assume !false; {126190#false} is VALID [2022-04-28 08:49:59,776 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-28 08:49:59,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:59,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412449840] [2022-04-28 08:49:59,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412449840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:59,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:59,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:59,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:59,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882900430] [2022-04-28 08:49:59,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882900430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:59,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:59,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004844783] [2022-04-28 08:49:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:59,777 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-28 08:49:59,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:59,777 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-28 08:49:59,840 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-28 08:49:59,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:59,841 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-28 08:50:05,263 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-28 08:50:07,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:14,120 INFO L93 Difference]: Finished difference Result 2254 states and 3569 transitions. [2022-04-28 08:50:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:50:14,120 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-28 08:50:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:50:14,120 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-28 08:50:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:50:14,122 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-28 08:50:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:50:14,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-28 08:50:14,501 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-28 08:50:14,564 INFO L225 Difference]: With dead ends: 2254 [2022-04-28 08:50:14,564 INFO L226 Difference]: Without dead ends: 1257 [2022-04-28 08:50:14,565 INFO L412 NwaCegarLoop]: 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-28 08:50:14,566 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 149 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s 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, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:50:14,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 390 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 08:50:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-04-28 08:50:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1023. [2022-04-28 08:50:14,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:50:14,624 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-28 08:50:14,625 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-28 08:50:14,625 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-28 08:50:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:14,663 INFO L93 Difference]: Finished difference Result 1257 states and 1945 transitions. [2022-04-28 08:50:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1945 transitions. [2022-04-28 08:50:14,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:14,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:14,665 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-28 08:50:14,665 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-28 08:50:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:14,705 INFO L93 Difference]: Finished difference Result 1257 states and 1945 transitions. [2022-04-28 08:50:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1945 transitions. [2022-04-28 08:50:14,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:14,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:14,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:50:14,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:50:14,707 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-28 08:50:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1628 transitions. [2022-04-28 08:50:14,746 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1628 transitions. Word has length 130 [2022-04-28 08:50:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:50:14,746 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1628 transitions. [2022-04-28 08:50:14,746 INFO L496 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-28 08:50:14,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1628 transitions. [2022-04-28 08:50:18,363 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-28 08:50:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1628 transitions. [2022-04-28 08:50:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 08:50:18,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:50:18,365 INFO L195 NwaCegarLoop]: 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-28 08:50:18,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 08:50:18,366 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:50:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:50:18,366 INFO L85 PathProgramCache]: Analyzing trace with hash -688048203, now seen corresponding path program 1 times [2022-04-28 08:50:18,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:18,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1626257044] [2022-04-28 08:50:18,439 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:50:18,439 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:50:18,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:50:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash -688048203, now seen corresponding path program 2 times [2022-04-28 08:50:18,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:50:18,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12085520] [2022-04-28 08:50:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:50:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:50:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:50:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:18,607 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-28 08:50:18,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {135269#true} assume true; {135269#true} is VALID [2022-04-28 08:50:18,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135269#true} {135269#true} #710#return; {135269#true} is VALID [2022-04-28 08:50:18,607 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-28 08:50:18,608 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-28 08:50:18,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {135269#true} assume true; {135269#true} is VALID [2022-04-28 08:50:18,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135269#true} {135269#true} #710#return; {135269#true} is VALID [2022-04-28 08:50:18,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {135269#true} call #t~ret161 := main(); {135269#true} is VALID [2022-04-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 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-28 08:50:18,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {135269#true} assume !false; {135269#true} is VALID [2022-04-28 08:50:18,608 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {135269#true} assume 8464 == #t~mem55;havoc #t~mem55; {135269#true} is VALID [2022-04-28 08:50:18,609 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-28 08:50:18,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {135269#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {135269#true} is VALID [2022-04-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,609 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-28 08:50:18,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {135269#true} ~skip~0 := 0; {135269#true} is VALID [2022-04-28 08:50:18,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {135269#true} assume !false; {135269#true} is VALID [2022-04-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 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-28 08:50:18,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {135269#true} assume 8496 == #t~mem58;havoc #t~mem58; {135269#true} is VALID [2022-04-28 08:50:18,611 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-28 08:50:18,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {135269#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {135269#true} is VALID [2022-04-28 08:50:18,611 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-28 08:50:18,611 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-28 08:50:18,612 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-28 08:50:18,613 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-28 08:50:18,613 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-28 08:50:18,613 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-28 08:50:18,614 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-28 08:50:18,614 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-28 08:50:18,614 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-28 08:50:18,615 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-28 08:50:18,615 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-28 08:50:18,615 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-28 08:50:18,616 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-28 08:50:18,616 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-28 08:50:18,616 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-28 08:50:18,616 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-28 08:50:18,616 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {135270#false} ~skip~0 := 0; {135270#false} is VALID [2022-04-28 08:50:18,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {135270#false} assume !false; {135270#false} is VALID [2022-04-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,617 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {135270#false} assume 8448 == #t~mem68;havoc #t~mem68; {135270#false} is VALID [2022-04-28 08:50:18,618 INFO L290 TraceCheckUtils]: 91: Hoare triple {135270#false} assume !(~num1~0 > 0); {135270#false} is VALID [2022-04-28 08:50:18,618 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-28 08:50:18,618 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-28 08:50:18,619 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-28 08:50:18,619 INFO L290 TraceCheckUtils]: 95: Hoare triple {135270#false} ~skip~0 := 0; {135270#false} is VALID [2022-04-28 08:50:18,619 INFO L290 TraceCheckUtils]: 96: Hoare triple {135270#false} assume !false; {135270#false} is VALID [2022-04-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,619 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,620 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-28 08:50:18,621 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-28 08:50:18,621 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-28 08:50:18,621 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-28 08:50:18,621 INFO L290 TraceCheckUtils]: 126: Hoare triple {135270#false} assume 8640 == #t~mem75;havoc #t~mem75; {135270#false} is VALID [2022-04-28 08:50:18,621 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-28 08:50:18,621 INFO L290 TraceCheckUtils]: 128: Hoare triple {135270#false} assume !(9 == ~blastFlag~0); {135270#false} is VALID [2022-04-28 08:50:18,621 INFO L290 TraceCheckUtils]: 129: Hoare triple {135270#false} assume 12 == ~blastFlag~0; {135270#false} is VALID [2022-04-28 08:50:18,621 INFO L290 TraceCheckUtils]: 130: Hoare triple {135270#false} assume !false; {135270#false} is VALID [2022-04-28 08:50:18,621 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-28 08:50:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:50:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12085520] [2022-04-28 08:50:18,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12085520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:18,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:18,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:18,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:50:18,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1626257044] [2022-04-28 08:50:18,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1626257044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:18,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:18,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430559830] [2022-04-28 08:50:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:50:18,622 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-28 08:50:18,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:50:18,623 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-28 08:50:18,686 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-28 08:50:18,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:50:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:18,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:50:18,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:50:18,687 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-28 08:50:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:33,009 INFO L93 Difference]: Finished difference Result 2297 states and 3629 transitions. [2022-04-28 08:50:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:50:33,010 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-28 08:50:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:50:33,010 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-28 08:50:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 08:50:33,012 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-28 08:50:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-28 08:50:33,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-28 08:50:33,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:33,428 INFO L225 Difference]: With dead ends: 2297 [2022-04-28 08:50:33,428 INFO L226 Difference]: Without dead ends: 1300 [2022-04-28 08:50:33,429 INFO L412 NwaCegarLoop]: 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-28 08:50:33,429 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 103 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:50:33,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 679 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 08:50:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2022-04-28 08:50:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1080. [2022-04-28 08:50:33,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:50:33,482 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-28 08:50:33,482 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-28 08:50:33,483 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-28 08:50:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:33,523 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2022-04-28 08:50:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2032 transitions. [2022-04-28 08:50:33,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:33,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:33,525 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-28 08:50:33,525 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-28 08:50:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:33,574 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2022-04-28 08:50:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2032 transitions. [2022-04-28 08:50:33,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:33,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:33,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:50:33,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:50:33,576 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-28 08:50:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1706 transitions. [2022-04-28 08:50:33,618 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1706 transitions. Word has length 131 [2022-04-28 08:50:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:50:33,618 INFO L495 AbstractCegarLoop]: Abstraction has 1080 states and 1706 transitions. [2022-04-28 08:50:33,618 INFO L496 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-28 08:50:33,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1080 states and 1706 transitions. [2022-04-28 08:50:37,319 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-28 08:50:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1706 transitions. [2022-04-28 08:50:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 08:50:37,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:50:37,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:50:37,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 08:50:37,321 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:50:37,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:50:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash 777583331, now seen corresponding path program 1 times [2022-04-28 08:50:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:37,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211456305] [2022-04-28 08:50:37,393 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:50:37,394 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:50:37,394 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:50:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash 777583331, now seen corresponding path program 2 times [2022-04-28 08:50:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:50:37,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400567111] [2022-04-28 08:50:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:50:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:50:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:50:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:37,572 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-28 08:50:37,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {144635#true} assume true; {144635#true} is VALID [2022-04-28 08:50:37,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144635#true} {144635#true} #710#return; {144635#true} is VALID [2022-04-28 08:50:37,573 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-28 08:50:37,573 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-28 08:50:37,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {144635#true} assume true; {144635#true} is VALID [2022-04-28 08:50:37,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144635#true} {144635#true} #710#return; {144635#true} is VALID [2022-04-28 08:50:37,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {144635#true} call #t~ret161 := main(); {144635#true} is VALID [2022-04-28 08:50:37,573 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-28 08:50:37,573 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-28 08:50:37,573 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-28 08:50:37,573 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-28 08:50:37,574 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-28 08:50:37,574 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-28 08:50:37,574 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-28 08:50:37,574 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-28 08:50:37,574 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-28 08:50:37,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {144635#true} assume !false; {144635#true} is VALID [2022-04-28 08:50:37,574 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-28 08:50:37,574 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-28 08:50:37,574 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-28 08:50:37,575 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-28 08:50:37,575 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-28 08:50:37,575 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-28 08:50:37,575 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-28 08:50:37,575 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-28 08:50:37,575 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-28 08:50:37,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {144635#true} assume 8464 == #t~mem55;havoc #t~mem55; {144635#true} is VALID [2022-04-28 08:50:37,575 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-28 08:50:37,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {144635#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {144635#true} is VALID [2022-04-28 08:50:37,575 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-28 08:50:37,575 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-28 08:50:37,575 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-28 08:50:37,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {144635#true} ~skip~0 := 0; {144635#true} is VALID [2022-04-28 08:50:37,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {144635#true} assume !false; {144635#true} is VALID [2022-04-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 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-28 08:50:37,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {144635#true} assume 8496 == #t~mem58;havoc #t~mem58; {144635#true} is VALID [2022-04-28 08:50:37,576 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-28 08:50:37,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {144635#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {144635#true} is VALID [2022-04-28 08:50:37,577 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-28 08:50:37,577 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-28 08:50:37,578 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-28 08:50:37,578 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-28 08:50:37,579 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-28 08:50:37,579 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-28 08:50:37,579 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-28 08:50:37,580 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-28 08:50:37,580 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-28 08:50:37,580 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-28 08:50:37,581 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-28 08:50:37,581 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-28 08:50:37,581 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-28 08:50:37,582 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-28 08:50:37,582 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-28 08:50:37,582 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-28 08:50:37,583 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-28 08:50:37,583 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-28 08:50:37,583 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-28 08:50:37,584 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-28 08:50:37,584 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-28 08:50:37,584 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-28 08:50:37,584 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-28 08:50:37,585 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-28 08:50:37,585 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-28 08:50:37,585 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-28 08:50:37,586 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-28 08:50:37,586 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-28 08:50:37,586 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-28 08:50:37,587 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-28 08:50:37,587 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-28 08:50:37,587 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-28 08:50:37,588 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-28 08:50:37,588 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-28 08:50:37,588 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-28 08:50:37,589 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-28 08:50:37,589 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-28 08:50:37,589 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-28 08:50:37,590 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-28 08:50:37,590 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-28 08:50:37,590 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-28 08:50:37,590 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-28 08:50:37,591 INFO L290 TraceCheckUtils]: 89: Hoare triple {144636#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {144636#false} is VALID [2022-04-28 08:50:37,591 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-28 08:50:37,591 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-28 08:50:37,591 INFO L290 TraceCheckUtils]: 92: Hoare triple {144636#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {144636#false} is VALID [2022-04-28 08:50:37,591 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-28 08:50:37,591 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-28 08:50:37,591 INFO L290 TraceCheckUtils]: 95: Hoare triple {144636#false} ~skip~0 := 0; {144636#false} is VALID [2022-04-28 08:50:37,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {144636#false} assume !false; {144636#false} is VALID [2022-04-28 08:50:37,591 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-28 08:50:37,591 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-28 08:50:37,591 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-28 08:50:37,591 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-28 08:50:37,591 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-28 08:50:37,591 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,592 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-28 08:50:37,593 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-28 08:50:37,593 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-28 08:50:37,593 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-28 08:50:37,593 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-28 08:50:37,593 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-28 08:50:37,593 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-28 08:50:37,593 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-28 08:50:37,593 INFO L290 TraceCheckUtils]: 126: Hoare triple {144636#false} assume 8640 == #t~mem75;havoc #t~mem75; {144636#false} is VALID [2022-04-28 08:50:37,593 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-28 08:50:37,593 INFO L290 TraceCheckUtils]: 128: Hoare triple {144636#false} assume !(9 == ~blastFlag~0); {144636#false} is VALID [2022-04-28 08:50:37,593 INFO L290 TraceCheckUtils]: 129: Hoare triple {144636#false} assume 12 == ~blastFlag~0; {144636#false} is VALID [2022-04-28 08:50:37,593 INFO L290 TraceCheckUtils]: 130: Hoare triple {144636#false} assume !false; {144636#false} is VALID [2022-04-28 08:50:37,594 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-28 08:50:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:50:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400567111] [2022-04-28 08:50:37,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400567111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:37,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:37,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:37,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:50:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211456305] [2022-04-28 08:50:37,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211456305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:37,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:37,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791252678] [2022-04-28 08:50:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:50:37,595 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-28 08:50:37,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:50:37,595 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-28 08:50:37,681 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-28 08:50:37,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:50:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:50:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:50:37,682 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-28 08:50:42,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:44,381 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-28 08:50:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:49,043 INFO L93 Difference]: Finished difference Result 2488 states and 3893 transitions. [2022-04-28 08:50:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:50:49,044 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-28 08:50:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:50:49,044 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-28 08:50:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:50:49,046 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-28 08:50:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:50:49,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-28 08:50:49,431 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-28 08:50:49,505 INFO L225 Difference]: With dead ends: 2488 [2022-04-28 08:50:49,506 INFO L226 Difference]: Without dead ends: 1434 [2022-04-28 08:50:49,507 INFO L412 NwaCegarLoop]: 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-28 08:50:49,507 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 121 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 58 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:50:49,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 391 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 494 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-04-28 08:50:49,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2022-04-28 08:50:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1209. [2022-04-28 08:50:49,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:50:49,579 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-28 08:50:49,580 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-28 08:50:49,580 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-28 08:50:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:49,628 INFO L93 Difference]: Finished difference Result 1434 states and 2218 transitions. [2022-04-28 08:50:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2218 transitions. [2022-04-28 08:50:49,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:49,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:49,630 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-28 08:50:49,630 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-28 08:50:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:49,679 INFO L93 Difference]: Finished difference Result 1434 states and 2218 transitions. [2022-04-28 08:50:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2218 transitions. [2022-04-28 08:50:49,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:49,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:49,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:50:49,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:50:49,680 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-28 08:50:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1919 transitions. [2022-04-28 08:50:49,734 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1919 transitions. Word has length 131 [2022-04-28 08:50:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:50:49,734 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1919 transitions. [2022-04-28 08:50:49,735 INFO L496 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-28 08:50:49,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1209 states and 1919 transitions. [2022-04-28 08:50:53,678 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-28 08:50:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1919 transitions. [2022-04-28 08:50:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 08:50:53,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:50:53,680 INFO L195 NwaCegarLoop]: 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-28 08:50:53,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 08:50:53,680 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:50:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:50:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash 636807991, now seen corresponding path program 1 times [2022-04-28 08:50:53,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:53,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618560330] [2022-04-28 08:50:53,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:50:53,747 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:50:53,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:50:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash 636807991, now seen corresponding path program 2 times [2022-04-28 08:50:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:50:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325044491] [2022-04-28 08:50:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:50:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:50:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:50:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:53,910 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-28 08:50:53,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {154909#true} assume true; {154909#true} is VALID [2022-04-28 08:50:53,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154909#true} {154909#true} #710#return; {154909#true} is VALID [2022-04-28 08:50:53,911 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-28 08:50:53,911 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-28 08:50:53,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {154909#true} assume true; {154909#true} is VALID [2022-04-28 08:50:53,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154909#true} {154909#true} #710#return; {154909#true} is VALID [2022-04-28 08:50:53,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {154909#true} call #t~ret161 := main(); {154909#true} is VALID [2022-04-28 08:50:53,911 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-28 08:50:53,911 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {154909#true} assume !false; {154909#true} is VALID [2022-04-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,912 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-28 08:50:53,913 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-28 08:50:53,913 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-28 08:50:53,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {154909#true} assume 8464 == #t~mem55;havoc #t~mem55; {154909#true} is VALID [2022-04-28 08:50:53,913 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-28 08:50:53,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {154909#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {154909#true} is VALID [2022-04-28 08:50:53,913 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-28 08:50:53,913 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-28 08:50:53,913 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-28 08:50:53,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {154909#true} ~skip~0 := 0; {154909#true} is VALID [2022-04-28 08:50:53,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {154909#true} assume !false; {154909#true} is VALID [2022-04-28 08:50:53,913 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-28 08:50:53,913 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-28 08:50:53,913 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-28 08:50:53,913 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-28 08:50:53,913 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-28 08:50:53,914 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-28 08:50:53,914 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-28 08:50:53,914 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-28 08:50:53,914 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-28 08:50:53,914 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-28 08:50:53,914 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-28 08:50:53,914 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-28 08:50:53,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {154909#true} assume 8496 == #t~mem58;havoc #t~mem58; {154909#true} is VALID [2022-04-28 08:50:53,914 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-28 08:50:53,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {154909#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {154909#true} is VALID [2022-04-28 08:50:53,914 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-28 08:50:53,915 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-28 08:50:53,916 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-28 08:50:53,916 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-28 08:50:53,916 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-28 08:50:53,917 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-28 08:50:53,917 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-28 08:50:53,917 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-28 08:50:53,918 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-28 08:50:53,918 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-28 08:50:53,918 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-28 08:50:53,919 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-28 08:50:53,919 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-28 08:50:53,919 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {154910#false} ~skip~0 := 0; {154910#false} is VALID [2022-04-28 08:50:53,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {154910#false} assume !false; {154910#false} is VALID [2022-04-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,920 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,921 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-28 08:50:53,922 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-28 08:50:53,922 INFO L290 TraceCheckUtils]: 90: Hoare triple {154910#false} assume 8448 == #t~mem68;havoc #t~mem68; {154910#false} is VALID [2022-04-28 08:50:53,922 INFO L290 TraceCheckUtils]: 91: Hoare triple {154910#false} assume !(~num1~0 > 0); {154910#false} is VALID [2022-04-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,922 INFO L290 TraceCheckUtils]: 95: Hoare triple {154910#false} ~skip~0 := 0; {154910#false} is VALID [2022-04-28 08:50:53,922 INFO L290 TraceCheckUtils]: 96: Hoare triple {154910#false} assume !false; {154910#false} is VALID [2022-04-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,922 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,923 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-28 08:50:53,924 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-28 08:50:53,924 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-28 08:50:53,924 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-28 08:50:53,924 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-28 08:50:53,924 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-28 08:50:53,924 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-28 08:50:53,924 INFO L290 TraceCheckUtils]: 126: Hoare triple {154910#false} assume 8640 == #t~mem75;havoc #t~mem75; {154910#false} is VALID [2022-04-28 08:50:53,924 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-28 08:50:53,924 INFO L290 TraceCheckUtils]: 128: Hoare triple {154910#false} assume !(9 == ~blastFlag~0); {154910#false} is VALID [2022-04-28 08:50:53,924 INFO L290 TraceCheckUtils]: 129: Hoare triple {154910#false} assume 12 == ~blastFlag~0; {154910#false} is VALID [2022-04-28 08:50:53,924 INFO L290 TraceCheckUtils]: 130: Hoare triple {154910#false} assume !false; {154910#false} is VALID [2022-04-28 08:50:53,924 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-28 08:50:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:50:53,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325044491] [2022-04-28 08:50:53,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325044491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:53,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:53,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:53,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:50:53,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618560330] [2022-04-28 08:50:53,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618560330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:53,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:53,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411568028] [2022-04-28 08:50:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:50:53,928 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-28 08:50:53,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:50:53,928 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-28 08:50:53,986 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-28 08:50:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:50:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:50:53,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:50:53,987 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-28 08:51:00,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:06,258 INFO L93 Difference]: Finished difference Result 2624 states and 4119 transitions. [2022-04-28 08:51:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:51:06,258 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-28 08:51:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:51:06,258 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-28 08:51:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:51:06,260 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-28 08:51:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:51:06,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-28 08:51:06,642 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-28 08:51:06,723 INFO L225 Difference]: With dead ends: 2624 [2022-04-28 08:51:06,723 INFO L226 Difference]: Without dead ends: 1441 [2022-04-28 08:51:06,724 INFO L412 NwaCegarLoop]: 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-28 08:51:06,725 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:51:06,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 362 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 08:51:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-04-28 08:51:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1152. [2022-04-28 08:51:06,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:51:06,792 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-28 08:51:06,792 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-28 08:51:06,793 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-28 08:51:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:06,841 INFO L93 Difference]: Finished difference Result 1441 states and 2215 transitions. [2022-04-28 08:51:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2215 transitions. [2022-04-28 08:51:06,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:06,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:06,842 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-28 08:51:06,843 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-28 08:51:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:06,891 INFO L93 Difference]: Finished difference Result 1441 states and 2215 transitions. [2022-04-28 08:51:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2215 transitions. [2022-04-28 08:51:06,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:06,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:06,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:51:06,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:51:06,893 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-28 08:51:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1822 transitions. [2022-04-28 08:51:06,950 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1822 transitions. Word has length 131 [2022-04-28 08:51:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:51:06,950 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 1822 transitions. [2022-04-28 08:51:06,950 INFO L496 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-28 08:51:06,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1152 states and 1822 transitions. [2022-04-28 08:51:10,972 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-28 08:51:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1822 transitions. [2022-04-28 08:51:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 08:51:10,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:51:10,973 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:51:10,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 08:51:10,973 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:51:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:51:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash -347293821, now seen corresponding path program 1 times [2022-04-28 08:51:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [199035100] [2022-04-28 08:51:11,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:51:11,047 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:51:11,048 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:51:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -347293821, now seen corresponding path program 2 times [2022-04-28 08:51:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:51:11,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676393279] [2022-04-28 08:51:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:51:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:51:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:51:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:11,218 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-28 08:51:11,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {165355#true} assume true; {165355#true} is VALID [2022-04-28 08:51:11,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165355#true} {165355#true} #710#return; {165355#true} is VALID [2022-04-28 08:51:11,219 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-28 08:51:11,219 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-28 08:51:11,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {165355#true} assume true; {165355#true} is VALID [2022-04-28 08:51:11,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165355#true} {165355#true} #710#return; {165355#true} is VALID [2022-04-28 08:51:11,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {165355#true} call #t~ret161 := main(); {165355#true} is VALID [2022-04-28 08:51:11,219 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-28 08:51:11,219 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-28 08:51:11,219 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-28 08:51:11,219 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-28 08:51:11,219 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-28 08:51:11,219 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {165355#true} assume !false; {165355#true} is VALID [2022-04-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 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-28 08:51:11,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {165355#true} assume 8464 == #t~mem55;havoc #t~mem55; {165355#true} is VALID [2022-04-28 08:51:11,220 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-28 08:51:11,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {165355#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {165355#true} is VALID [2022-04-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {165355#true} ~skip~0 := 0; {165355#true} is VALID [2022-04-28 08:51:11,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {165355#true} assume !false; {165355#true} is VALID [2022-04-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,221 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-28 08:51:11,222 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-28 08:51:11,222 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-28 08:51:11,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {165355#true} assume 8496 == #t~mem58;havoc #t~mem58; {165355#true} is VALID [2022-04-28 08:51:11,222 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-28 08:51:11,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {165355#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {165355#true} is VALID [2022-04-28 08:51:11,222 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-28 08:51:11,223 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-28 08:51:11,223 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-28 08:51:11,224 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-28 08:51:11,224 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-28 08:51:11,224 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-28 08:51:11,225 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-28 08:51:11,225 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-28 08:51:11,225 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-28 08:51:11,226 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-28 08:51:11,226 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-28 08:51:11,226 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-28 08:51:11,227 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-28 08:51:11,227 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-28 08:51:11,228 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-28 08:51:11,228 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-28 08:51:11,228 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-28 08:51:11,229 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-28 08:51:11,229 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-28 08:51:11,229 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-28 08:51:11,230 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-28 08:51:11,230 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-28 08:51:11,230 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-28 08:51:11,231 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-28 08:51:11,231 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-28 08:51:11,231 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-28 08:51:11,232 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-28 08:51:11,232 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-28 08:51:11,232 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-28 08:51:11,233 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-28 08:51:11,233 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-28 08:51:11,233 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-28 08:51:11,234 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-28 08:51:11,234 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-28 08:51:11,234 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-28 08:51:11,235 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-28 08:51:11,235 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-28 08:51:11,235 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-28 08:51:11,236 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-28 08:51:11,236 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-28 08:51:11,236 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-28 08:51:11,236 INFO L290 TraceCheckUtils]: 88: Hoare triple {165356#false} assume 8673 == #t~mem80;havoc #t~mem80; {165356#false} is VALID [2022-04-28 08:51:11,236 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-28 08:51:11,236 INFO L290 TraceCheckUtils]: 90: Hoare triple {165356#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {165356#false} is VALID [2022-04-28 08:51:11,236 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-28 08:51:11,236 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-28 08:51:11,236 INFO L290 TraceCheckUtils]: 93: Hoare triple {165356#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {165356#false} is VALID [2022-04-28 08:51:11,236 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-28 08:51:11,236 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-28 08:51:11,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {165356#false} ~skip~0 := 0; {165356#false} is VALID [2022-04-28 08:51:11,237 INFO L290 TraceCheckUtils]: 97: Hoare triple {165356#false} assume !false; {165356#false} is VALID [2022-04-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,237 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 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-28 08:51:11,238 INFO L290 TraceCheckUtils]: 127: Hoare triple {165356#false} assume 8640 == #t~mem75;havoc #t~mem75; {165356#false} is VALID [2022-04-28 08:51:11,239 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-28 08:51:11,239 INFO L290 TraceCheckUtils]: 129: Hoare triple {165356#false} assume !(9 == ~blastFlag~0); {165356#false} is VALID [2022-04-28 08:51:11,239 INFO L290 TraceCheckUtils]: 130: Hoare triple {165356#false} assume 12 == ~blastFlag~0; {165356#false} is VALID [2022-04-28 08:51:11,239 INFO L290 TraceCheckUtils]: 131: Hoare triple {165356#false} assume !false; {165356#false} is VALID [2022-04-28 08:51:11,239 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-28 08:51:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:51:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676393279] [2022-04-28 08:51:11,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676393279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:11,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:11,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:11,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:51:11,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [199035100] [2022-04-28 08:51:11,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [199035100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:11,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:11,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575882404] [2022-04-28 08:51:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:51:11,240 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-28 08:51:11,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:51:11,241 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-28 08:51:11,316 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-28 08:51:11,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:51:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:51:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:51:11,316 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-28 08:51:13,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:18,254 INFO L93 Difference]: Finished difference Result 2537 states and 3990 transitions. [2022-04-28 08:51:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:51:18,254 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-28 08:51:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:51:18,254 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-28 08:51:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2022-04-28 08:51:18,256 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-28 08:51:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2022-04-28 08:51:18,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 555 transitions. [2022-04-28 08:51:18,625 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-28 08:51:18,706 INFO L225 Difference]: With dead ends: 2537 [2022-04-28 08:51:18,706 INFO L226 Difference]: Without dead ends: 1411 [2022-04-28 08:51:18,707 INFO L412 NwaCegarLoop]: 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-28 08:51:18,707 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 70 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 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, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:51:18,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 667 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 602 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 08:51:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-04-28 08:51:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1281. [2022-04-28 08:51:18,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:51:18,793 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-28 08:51:18,794 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-28 08:51:18,795 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-28 08:51:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:18,846 INFO L93 Difference]: Finished difference Result 1411 states and 2198 transitions. [2022-04-28 08:51:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2198 transitions. [2022-04-28 08:51:18,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:18,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:18,848 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-28 08:51:18,848 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-28 08:51:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:18,901 INFO L93 Difference]: Finished difference Result 1411 states and 2198 transitions. [2022-04-28 08:51:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2198 transitions. [2022-04-28 08:51:18,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:18,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:18,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:51:18,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:51:18,903 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-28 08:51:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 2026 transitions. [2022-04-28 08:51:18,980 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 2026 transitions. Word has length 132 [2022-04-28 08:51:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:51:18,980 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 2026 transitions. [2022-04-28 08:51:18,980 INFO L496 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-28 08:51:18,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1281 states and 2026 transitions. [2022-04-28 08:51:23,158 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-28 08:51:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2026 transitions. [2022-04-28 08:51:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 08:51:23,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:51:23,160 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:51:23,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 08:51:23,160 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:51:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:51:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2068542529, now seen corresponding path program 1 times [2022-04-28 08:51:23,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:23,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119371729] [2022-04-28 08:51:23,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:51:23,222 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:51:23,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:51:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2068542529, now seen corresponding path program 2 times [2022-04-28 08:51:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:51:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300083899] [2022-04-28 08:51:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:51:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:51:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:23,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:51:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:23,409 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-28 08:51:23,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {175825#true} assume true; {175825#true} is VALID [2022-04-28 08:51:23,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175825#true} {175825#true} #710#return; {175825#true} is VALID [2022-04-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {175825#true} assume true; {175825#true} is VALID [2022-04-28 08:51:23,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175825#true} {175825#true} #710#return; {175825#true} is VALID [2022-04-28 08:51:23,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {175825#true} call #t~ret161 := main(); {175825#true} is VALID [2022-04-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,410 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-28 08:51:23,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {175825#true} assume !false; {175825#true} is VALID [2022-04-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {175825#true} assume 8464 == #t~mem55;havoc #t~mem55; {175825#true} is VALID [2022-04-28 08:51:23,411 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-28 08:51:23,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {175825#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {175825#true} is VALID [2022-04-28 08:51:23,411 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-28 08:51:23,411 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-28 08:51:23,412 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-28 08:51:23,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {175825#true} ~skip~0 := 0; {175825#true} is VALID [2022-04-28 08:51:23,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {175825#true} assume !false; {175825#true} is VALID [2022-04-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 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-28 08:51:23,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {175825#true} assume 8496 == #t~mem58;havoc #t~mem58; {175825#true} is VALID [2022-04-28 08:51:23,413 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-28 08:51:23,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {175825#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {175825#true} is VALID [2022-04-28 08:51:23,413 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-28 08:51:23,413 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-28 08:51:23,414 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-28 08:51:23,415 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-28 08:51:23,415 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-28 08:51:23,415 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-28 08:51:23,416 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-28 08:51:23,416 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-28 08:51:23,416 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-28 08:51:23,416 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-28 08:51:23,417 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-28 08:51:23,417 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-28 08:51:23,417 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-28 08:51:23,418 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-28 08:51:23,418 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-28 08:51:23,418 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-28 08:51:23,419 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-28 08:51:23,419 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-28 08:51:23,419 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-28 08:51:23,420 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-28 08:51:23,420 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-28 08:51:23,420 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-28 08:51:23,421 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-28 08:51:23,421 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-28 08:51:23,422 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-28 08:51:23,422 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-28 08:51:23,422 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-28 08:51:23,422 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-28 08:51:23,423 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-28 08:51:23,423 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-28 08:51:23,423 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-28 08:51:23,424 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-28 08:51:23,424 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-28 08:51:23,424 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-28 08:51:23,425 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-28 08:51:23,425 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-28 08:51:23,425 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-28 08:51:23,426 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-28 08:51:23,426 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-28 08:51:23,426 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-28 08:51:23,427 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-28 08:51:23,427 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-28 08:51:23,427 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-28 08:51:23,427 INFO L290 TraceCheckUtils]: 90: Hoare triple {175826#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {175826#false} is VALID [2022-04-28 08:51:23,427 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-28 08:51:23,427 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-28 08:51:23,427 INFO L290 TraceCheckUtils]: 93: Hoare triple {175826#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {175826#false} is VALID [2022-04-28 08:51:23,427 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-28 08:51:23,428 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-28 08:51:23,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {175826#false} ~skip~0 := 0; {175826#false} is VALID [2022-04-28 08:51:23,428 INFO L290 TraceCheckUtils]: 97: Hoare triple {175826#false} assume !false; {175826#false} is VALID [2022-04-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,428 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,429 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-28 08:51:23,430 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-28 08:51:23,430 INFO L290 TraceCheckUtils]: 127: Hoare triple {175826#false} assume 8640 == #t~mem75;havoc #t~mem75; {175826#false} is VALID [2022-04-28 08:51:23,430 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-28 08:51:23,430 INFO L290 TraceCheckUtils]: 129: Hoare triple {175826#false} assume !(9 == ~blastFlag~0); {175826#false} is VALID [2022-04-28 08:51:23,430 INFO L290 TraceCheckUtils]: 130: Hoare triple {175826#false} assume 12 == ~blastFlag~0; {175826#false} is VALID [2022-04-28 08:51:23,430 INFO L290 TraceCheckUtils]: 131: Hoare triple {175826#false} assume !false; {175826#false} is VALID [2022-04-28 08:51:23,430 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-28 08:51:23,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:51:23,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300083899] [2022-04-28 08:51:23,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300083899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:23,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:23,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:23,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:51:23,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119371729] [2022-04-28 08:51:23,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119371729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:23,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:23,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323271991] [2022-04-28 08:51:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:51:23,431 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-28 08:51:23,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:51:23,432 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-28 08:51:23,517 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-28 08:51:23,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:51:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:23,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:51:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:51:23,517 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-28 08:51:30,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:37,743 INFO L93 Difference]: Finished difference Result 2768 states and 4334 transitions. [2022-04-28 08:51:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:51:37,744 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-28 08:51:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:51:37,744 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-28 08:51:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-28 08:51:37,746 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-28 08:51:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2022-04-28 08:51:37,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 608 transitions. [2022-04-28 08:51:38,134 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-28 08:51:38,213 INFO L225 Difference]: With dead ends: 2768 [2022-04-28 08:51:38,213 INFO L226 Difference]: Without dead ends: 1507 [2022-04-28 08:51:38,214 INFO L412 NwaCegarLoop]: 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-28 08:51:38,214 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 121 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:51:38,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 382 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 08:51:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-04-28 08:51:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1287. [2022-04-28 08:51:38,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:51:38,302 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-28 08:51:38,303 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-28 08:51:38,304 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-28 08:51:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:38,355 INFO L93 Difference]: Finished difference Result 1507 states and 2329 transitions. [2022-04-28 08:51:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2329 transitions. [2022-04-28 08:51:38,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:38,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:38,357 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-28 08:51:38,357 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-28 08:51:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:38,409 INFO L93 Difference]: Finished difference Result 1507 states and 2329 transitions. [2022-04-28 08:51:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2329 transitions. [2022-04-28 08:51:38,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:38,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:38,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:51:38,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:51:38,412 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-28 08:51:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2035 transitions. [2022-04-28 08:51:38,470 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2035 transitions. Word has length 132 [2022-04-28 08:51:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:51:38,470 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 2035 transitions. [2022-04-28 08:51:38,471 INFO L496 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-28 08:51:38,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1287 states and 2035 transitions. [2022-04-28 08:51:42,730 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-28 08:51:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2035 transitions. [2022-04-28 08:51:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-28 08:51:42,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:51:42,732 INFO L195 NwaCegarLoop]: 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-28 08:51:42,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 08:51:42,732 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:51:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:51:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -231720393, now seen corresponding path program 1 times [2022-04-28 08:51:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1904536310] [2022-04-28 08:51:42,799 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:51:42,799 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:51:42,799 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:51:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -231720393, now seen corresponding path program 2 times [2022-04-28 08:51:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:51:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146241665] [2022-04-28 08:51:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:51:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:51:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:51:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:42,959 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-28 08:51:42,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {186961#true} assume true; {186961#true} is VALID [2022-04-28 08:51:42,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186961#true} {186961#true} #710#return; {186961#true} is VALID [2022-04-28 08:51:42,959 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-28 08:51:42,960 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-28 08:51:42,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {186961#true} assume true; {186961#true} is VALID [2022-04-28 08:51:42,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186961#true} {186961#true} #710#return; {186961#true} is VALID [2022-04-28 08:51:42,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {186961#true} call #t~ret161 := main(); {186961#true} is VALID [2022-04-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 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-28 08:51:42,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {186961#true} assume !false; {186961#true} is VALID [2022-04-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {186961#true} assume 8464 == #t~mem55;havoc #t~mem55; {186961#true} is VALID [2022-04-28 08:51:42,961 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-28 08:51:42,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {186961#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {186961#true} is VALID [2022-04-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,961 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-28 08:51:42,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {186961#true} ~skip~0 := 0; {186961#true} is VALID [2022-04-28 08:51:42,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {186961#true} assume !false; {186961#true} is VALID [2022-04-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 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-28 08:51:42,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {186961#true} assume 8496 == #t~mem58;havoc #t~mem58; {186961#true} is VALID [2022-04-28 08:51:42,962 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-28 08:51:42,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {186961#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {186961#true} is VALID [2022-04-28 08:51:42,963 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-28 08:51:42,963 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-28 08:51:42,964 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-28 08:51:42,964 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-28 08:51:42,965 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-28 08:51:42,965 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-28 08:51:42,965 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-28 08:51:42,966 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-28 08:51:42,966 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-28 08:51:42,966 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-28 08:51:42,967 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-28 08:51:42,967 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-28 08:51:42,968 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-28 08:51:42,968 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-28 08:51:42,968 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-28 08:51:42,969 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-28 08:51:42,969 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-28 08:51:42,969 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-28 08:51:42,970 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-28 08:51:42,970 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-28 08:51:42,970 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-28 08:51:42,971 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-28 08:51:42,971 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-28 08:51:42,971 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-28 08:51:42,972 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-28 08:51:42,972 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-28 08:51:42,972 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-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {186962#false} ~skip~0 := 0; {186962#false} is VALID [2022-04-28 08:51:42,973 INFO L290 TraceCheckUtils]: 80: Hoare triple {186962#false} assume !false; {186962#false} is VALID [2022-04-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,973 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,974 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-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,975 INFO L290 TraceCheckUtils]: 103: Hoare triple {186962#false} assume 8448 == #t~mem68;havoc #t~mem68; {186962#false} is VALID [2022-04-28 08:51:42,975 INFO L290 TraceCheckUtils]: 104: Hoare triple {186962#false} assume !(~num1~0 > 0); {186962#false} is VALID [2022-04-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,975 INFO L290 TraceCheckUtils]: 108: Hoare triple {186962#false} ~skip~0 := 0; {186962#false} is VALID [2022-04-28 08:51:42,975 INFO L290 TraceCheckUtils]: 109: Hoare triple {186962#false} assume !false; {186962#false} is VALID [2022-04-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,975 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,976 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-28 08:51:42,977 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-28 08:51:42,977 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-28 08:51:42,977 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-28 08:51:42,977 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-28 08:51:42,977 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-28 08:51:42,977 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-28 08:51:42,977 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-28 08:51:42,977 INFO L290 TraceCheckUtils]: 139: Hoare triple {186962#false} assume 8640 == #t~mem75;havoc #t~mem75; {186962#false} is VALID [2022-04-28 08:51:42,977 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-28 08:51:42,977 INFO L290 TraceCheckUtils]: 141: Hoare triple {186962#false} assume !(9 == ~blastFlag~0); {186962#false} is VALID [2022-04-28 08:51:42,977 INFO L290 TraceCheckUtils]: 142: Hoare triple {186962#false} assume 12 == ~blastFlag~0; {186962#false} is VALID [2022-04-28 08:51:42,977 INFO L290 TraceCheckUtils]: 143: Hoare triple {186962#false} assume !false; {186962#false} is VALID [2022-04-28 08:51:42,978 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-28 08:51:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:51:42,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146241665] [2022-04-28 08:51:42,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146241665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:42,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:42,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:42,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:51:42,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1904536310] [2022-04-28 08:51:42,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1904536310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:42,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:42,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704534561] [2022-04-28 08:51:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:51:42,979 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-28 08:51:42,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:51:42,979 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-28 08:51:43,056 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-28 08:51:43,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:51:43,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:43,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:51:43,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:51:43,057 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-28 08:51:45,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:47,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:49,987 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-28 08:51:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:56,376 INFO L93 Difference]: Finished difference Result 2678 states and 4209 transitions. [2022-04-28 08:51:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:51:56,377 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-28 08:51:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:51:56,377 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-28 08:51:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2022-04-28 08:51:56,379 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-28 08:51:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2022-04-28 08:51:56,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 554 transitions. [2022-04-28 08:51:56,710 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-28 08:51:56,786 INFO L225 Difference]: With dead ends: 2678 [2022-04-28 08:51:56,786 INFO L226 Difference]: Without dead ends: 1417 [2022-04-28 08:51:56,787 INFO L412 NwaCegarLoop]: 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-28 08:51:56,788 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 80 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:51:56,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 667 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 601 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-04-28 08:51:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2022-04-28 08:51:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1287. [2022-04-28 08:51:56,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:51:56,870 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-28 08:51:56,870 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-28 08:51:56,871 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-28 08:51:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:56,919 INFO L93 Difference]: Finished difference Result 1417 states and 2204 transitions. [2022-04-28 08:51:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2204 transitions. [2022-04-28 08:51:56,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:56,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:56,921 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-28 08:51:56,921 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-28 08:51:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:56,968 INFO L93 Difference]: Finished difference Result 1417 states and 2204 transitions. [2022-04-28 08:51:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2204 transitions. [2022-04-28 08:51:56,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:56,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:56,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:51:56,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:51:56,970 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-28 08:51:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2032 transitions. [2022-04-28 08:51:57,044 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2032 transitions. Word has length 144 [2022-04-28 08:51:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:51:57,044 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 2032 transitions. [2022-04-28 08:51:57,044 INFO L496 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-28 08:51:57,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1287 states and 2032 transitions. [2022-04-28 08:52:01,380 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-28 08:52:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2032 transitions. [2022-04-28 08:52:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-28 08:52:01,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:52:01,382 INFO L195 NwaCegarLoop]: 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-28 08:52:01,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 08:52:01,382 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:52:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:52:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1288451595, now seen corresponding path program 1 times [2022-04-28 08:52:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:01,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146714886] [2022-04-28 08:52:01,451 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:52:01,451 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:52:01,451 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:52:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1288451595, now seen corresponding path program 2 times [2022-04-28 08:52:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:52:01,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565906768] [2022-04-28 08:52:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:52:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:52:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:52:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:01,646 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-28 08:52:01,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {197737#true} assume true; {197737#true} is VALID [2022-04-28 08:52:01,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197737#true} {197737#true} #710#return; {197737#true} is VALID [2022-04-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {197737#true} assume true; {197737#true} is VALID [2022-04-28 08:52:01,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197737#true} {197737#true} #710#return; {197737#true} is VALID [2022-04-28 08:52:01,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {197737#true} call #t~ret161 := main(); {197737#true} is VALID [2022-04-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,647 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-28 08:52:01,648 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-28 08:52:01,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {197737#true} assume !false; {197737#true} is VALID [2022-04-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 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-28 08:52:01,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {197737#true} assume 8464 == #t~mem55;havoc #t~mem55; {197737#true} is VALID [2022-04-28 08:52:01,648 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-28 08:52:01,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {197737#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {197737#true} is VALID [2022-04-28 08:52:01,648 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {197737#true} ~skip~0 := 0; {197737#true} is VALID [2022-04-28 08:52:01,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {197737#true} assume !false; {197737#true} is VALID [2022-04-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,649 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-28 08:52:01,650 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-28 08:52:01,650 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-28 08:52:01,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {197737#true} assume 8496 == #t~mem58;havoc #t~mem58; {197737#true} is VALID [2022-04-28 08:52:01,650 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-28 08:52:01,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {197737#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {197737#true} is VALID [2022-04-28 08:52:01,650 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-28 08:52:01,651 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-28 08:52:01,651 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-28 08:52:01,652 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-28 08:52:01,652 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-28 08:52:01,653 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-28 08:52:01,653 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-28 08:52:01,654 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-28 08:52:01,654 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-28 08:52:01,655 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-28 08:52:01,655 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-28 08:52:01,656 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-28 08:52:01,656 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-28 08:52:01,657 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-28 08:52:01,657 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-28 08:52:01,657 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-28 08:52:01,658 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-28 08:52:01,658 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-28 08:52:01,659 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-28 08:52:01,659 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-28 08:52:01,660 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-28 08:52:01,660 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-28 08:52:01,660 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-28 08:52:01,660 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-28 08:52:01,661 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-28 08:52:01,661 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-28 08:52:01,661 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-28 08:52:01,661 INFO L290 TraceCheckUtils]: 74: Hoare triple {197738#false} assume 8560 == #t~mem66;havoc #t~mem66; {197738#false} is VALID [2022-04-28 08:52:01,661 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-28 08:52:01,661 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-28 08:52:01,661 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-28 08:52:01,661 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-28 08:52:01,661 INFO L290 TraceCheckUtils]: 79: Hoare triple {197738#false} ~skip~0 := 0; {197738#false} is VALID [2022-04-28 08:52:01,661 INFO L290 TraceCheckUtils]: 80: Hoare triple {197738#false} assume !false; {197738#false} is VALID [2022-04-28 08:52:01,661 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,662 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 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-28 08:52:01,663 INFO L290 TraceCheckUtils]: 103: Hoare triple {197738#false} assume 8448 == #t~mem68;havoc #t~mem68; {197738#false} is VALID [2022-04-28 08:52:01,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {197738#false} assume !(~num1~0 > 0); {197738#false} is VALID [2022-04-28 08:52:01,664 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-28 08:52:01,664 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-28 08:52:01,664 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-28 08:52:01,664 INFO L290 TraceCheckUtils]: 108: Hoare triple {197738#false} ~skip~0 := 0; {197738#false} is VALID [2022-04-28 08:52:01,664 INFO L290 TraceCheckUtils]: 109: Hoare triple {197738#false} assume !false; {197738#false} is VALID [2022-04-28 08:52:01,664 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-28 08:52:01,664 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-28 08:52:01,664 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-28 08:52:01,664 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-28 08:52:01,664 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,665 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,666 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-28 08:52:01,667 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-28 08:52:01,667 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-28 08:52:01,667 INFO L290 TraceCheckUtils]: 139: Hoare triple {197738#false} assume 8640 == #t~mem75;havoc #t~mem75; {197738#false} is VALID [2022-04-28 08:52:01,667 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-28 08:52:01,667 INFO L290 TraceCheckUtils]: 141: Hoare triple {197738#false} assume !(9 == ~blastFlag~0); {197738#false} is VALID [2022-04-28 08:52:01,667 INFO L290 TraceCheckUtils]: 142: Hoare triple {197738#false} assume 12 == ~blastFlag~0; {197738#false} is VALID [2022-04-28 08:52:01,667 INFO L290 TraceCheckUtils]: 143: Hoare triple {197738#false} assume !false; {197738#false} is VALID [2022-04-28 08:52:01,668 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-28 08:52:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:52:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565906768] [2022-04-28 08:52:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565906768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:01,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:01,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:01,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:52:01,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146714886] [2022-04-28 08:52:01,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146714886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:01,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:01,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820369289] [2022-04-28 08:52:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:52:01,669 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-28 08:52:01,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:52:01,669 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-28 08:52:01,751 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-28 08:52:01,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:52:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:52:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:52:01,752 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-28 08:52:05,172 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-28 08:52:07,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:17,346 INFO L93 Difference]: Finished difference Result 2684 states and 4227 transitions. [2022-04-28 08:52:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:17,346 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-28 08:52:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:17,346 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-28 08:52:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-28 08:52:17,348 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-28 08:52:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-04-28 08:52:17,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 493 transitions. [2022-04-28 08:52:17,648 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-28 08:52:17,721 INFO L225 Difference]: With dead ends: 2684 [2022-04-28 08:52:17,721 INFO L226 Difference]: Without dead ends: 1423 [2022-04-28 08:52:17,723 INFO L412 NwaCegarLoop]: 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-28 08:52:17,723 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 37 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:52:17,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 623 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 08:52:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-04-28 08:52:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1359. [2022-04-28 08:52:17,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:52:17,820 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-28 08:52:17,820 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-28 08:52:17,821 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-28 08:52:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:17,877 INFO L93 Difference]: Finished difference Result 1423 states and 2225 transitions. [2022-04-28 08:52:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2225 transitions. [2022-04-28 08:52:17,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:17,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:17,879 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-28 08:52:17,880 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-28 08:52:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:17,941 INFO L93 Difference]: Finished difference Result 1423 states and 2225 transitions. [2022-04-28 08:52:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2225 transitions. [2022-04-28 08:52:17,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:17,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:17,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:52:17,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:52:17,943 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-28 08:52:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2143 transitions. [2022-04-28 08:52:18,023 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2143 transitions. Word has length 144 [2022-04-28 08:52:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:52:18,024 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 2143 transitions. [2022-04-28 08:52:18,024 INFO L496 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-28 08:52:18,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2143 transitions. [2022-04-28 08:52:22,550 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-28 08:52:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2143 transitions. [2022-04-28 08:52:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 08:52:22,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:52:22,552 INFO L195 NwaCegarLoop]: 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-28 08:52:22,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 08:52:22,552 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:52:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:52:22,553 INFO L85 PathProgramCache]: Analyzing trace with hash -901822382, now seen corresponding path program 1 times [2022-04-28 08:52:22,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:22,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442963061] [2022-04-28 08:52:22,633 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:52:22,634 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:52:22,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:52:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -901822382, now seen corresponding path program 2 times [2022-04-28 08:52:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:52:22,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443464031] [2022-04-28 08:52:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:52:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:52:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:52:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:22,795 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-28 08:52:22,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {208681#true} assume true; {208681#true} is VALID [2022-04-28 08:52:22,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208681#true} {208681#true} #710#return; {208681#true} is VALID [2022-04-28 08:52:22,796 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-28 08:52:22,796 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-28 08:52:22,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {208681#true} assume true; {208681#true} is VALID [2022-04-28 08:52:22,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208681#true} {208681#true} #710#return; {208681#true} is VALID [2022-04-28 08:52:22,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {208681#true} call #t~ret161 := main(); {208681#true} is VALID [2022-04-28 08:52:22,796 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-28 08:52:22,796 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {208681#true} assume !false; {208681#true} is VALID [2022-04-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,797 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-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {208681#true} assume 8464 == #t~mem55;havoc #t~mem55; {208681#true} is VALID [2022-04-28 08:52:22,798 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-28 08:52:22,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {208681#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {208681#true} is VALID [2022-04-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {208681#true} ~skip~0 := 0; {208681#true} is VALID [2022-04-28 08:52:22,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {208681#true} assume !false; {208681#true} is VALID [2022-04-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,798 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-28 08:52:22,799 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-28 08:52:22,799 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-28 08:52:22,799 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-28 08:52:22,799 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-28 08:52:22,799 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-28 08:52:22,799 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-28 08:52:22,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {208681#true} assume 8496 == #t~mem58;havoc #t~mem58; {208681#true} is VALID [2022-04-28 08:52:22,799 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-28 08:52:22,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {208681#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {208681#true} is VALID [2022-04-28 08:52:22,799 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-28 08:52:22,800 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-28 08:52:22,801 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-28 08:52:22,801 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-28 08:52:22,801 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-28 08:52:22,802 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-28 08:52:22,802 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-28 08:52:22,802 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-28 08:52:22,803 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-28 08:52:22,803 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-28 08:52:22,803 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-28 08:52:22,804 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-28 08:52:22,804 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-28 08:52:22,804 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-28 08:52:22,805 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-28 08:52:22,805 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-28 08:52:22,805 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-28 08:52:22,806 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-28 08:52:22,806 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-28 08:52:22,806 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-28 08:52:22,807 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-28 08:52:22,807 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-28 08:52:22,807 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-28 08:52:22,808 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-28 08:52:22,808 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-28 08:52:22,808 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-28 08:52:22,809 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-28 08:52:22,809 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-28 08:52:22,809 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-28 08:52:22,809 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {208682#false} ~skip~0 := 0; {208682#false} is VALID [2022-04-28 08:52:22,810 INFO L290 TraceCheckUtils]: 81: Hoare triple {208682#false} assume !false; {208682#false} is VALID [2022-04-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,810 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 INFO L290 TraceCheckUtils]: 104: Hoare triple {208682#false} assume 8448 == #t~mem68;havoc #t~mem68; {208682#false} is VALID [2022-04-28 08:52:22,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {208682#false} assume !(~num1~0 > 0); {208682#false} is VALID [2022-04-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,811 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-28 08:52:22,812 INFO L290 TraceCheckUtils]: 109: Hoare triple {208682#false} ~skip~0 := 0; {208682#false} is VALID [2022-04-28 08:52:22,812 INFO L290 TraceCheckUtils]: 110: Hoare triple {208682#false} assume !false; {208682#false} is VALID [2022-04-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,812 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,813 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-28 08:52:22,814 INFO L290 TraceCheckUtils]: 140: Hoare triple {208682#false} assume 8640 == #t~mem75;havoc #t~mem75; {208682#false} is VALID [2022-04-28 08:52:22,814 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-28 08:52:22,814 INFO L290 TraceCheckUtils]: 142: Hoare triple {208682#false} assume !(9 == ~blastFlag~0); {208682#false} is VALID [2022-04-28 08:52:22,814 INFO L290 TraceCheckUtils]: 143: Hoare triple {208682#false} assume 12 == ~blastFlag~0; {208682#false} is VALID [2022-04-28 08:52:22,814 INFO L290 TraceCheckUtils]: 144: Hoare triple {208682#false} assume !false; {208682#false} is VALID [2022-04-28 08:52:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 08:52:22,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:52:22,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443464031] [2022-04-28 08:52:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443464031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:22,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:22,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:52:22,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442963061] [2022-04-28 08:52:22,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442963061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:22,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:22,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534470194] [2022-04-28 08:52:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:52:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-28 08:52:22,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:52:22,816 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-28 08:52:22,886 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-28 08:52:22,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:52:22,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:22,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:52:22,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:52:22,886 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-28 08:52:25,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:27,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:32,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:36,227 INFO L93 Difference]: Finished difference Result 2912 states and 4547 transitions. [2022-04-28 08:52:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:36,227 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-28 08:52:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:36,228 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-28 08:52:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-28 08:52:36,230 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-28 08:52:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-28 08:52:36,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-28 08:52:36,606 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-28 08:52:36,706 INFO L225 Difference]: With dead ends: 2912 [2022-04-28 08:52:36,706 INFO L226 Difference]: Without dead ends: 1579 [2022-04-28 08:52:36,708 INFO L412 NwaCegarLoop]: 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-28 08:52:36,708 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 131 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s 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, 6.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:52:36,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 384 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-28 08:52:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-04-28 08:52:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1359. [2022-04-28 08:52:36,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:52:36,810 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-28 08:52:36,811 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-28 08:52:36,812 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-28 08:52:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:36,875 INFO L93 Difference]: Finished difference Result 1579 states and 2416 transitions. [2022-04-28 08:52:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2416 transitions. [2022-04-28 08:52:36,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:36,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:36,877 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-28 08:52:36,878 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-28 08:52:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:36,941 INFO L93 Difference]: Finished difference Result 1579 states and 2416 transitions. [2022-04-28 08:52:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2416 transitions. [2022-04-28 08:52:36,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:36,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:36,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:52:36,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:52:36,943 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-28 08:52:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2122 transitions. [2022-04-28 08:52:37,018 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2122 transitions. Word has length 145 [2022-04-28 08:52:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:52:37,018 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 2122 transitions. [2022-04-28 08:52:37,019 INFO L496 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-28 08:52:37,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2122 transitions. [2022-04-28 08:52:41,487 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-28 08:52:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2122 transitions. [2022-04-28 08:52:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 08:52:41,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:52:41,489 INFO L195 NwaCegarLoop]: 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-28 08:52:41,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 08:52:41,489 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:52:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:52:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash -250376814, now seen corresponding path program 1 times [2022-04-28 08:52:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:41,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91877056] [2022-04-28 08:52:41,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:52:41,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:52:41,564 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:52:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash -250376814, now seen corresponding path program 2 times [2022-04-28 08:52:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:52:41,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242063465] [2022-04-28 08:52:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:52:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:52:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:41,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:52:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:41,717 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-28 08:52:41,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {220393#true} assume true; {220393#true} is VALID [2022-04-28 08:52:41,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220393#true} {220393#true} #710#return; {220393#true} is VALID [2022-04-28 08:52:41,718 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-28 08:52:41,718 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-28 08:52:41,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {220393#true} assume true; {220393#true} is VALID [2022-04-28 08:52:41,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220393#true} {220393#true} #710#return; {220393#true} is VALID [2022-04-28 08:52:41,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {220393#true} call #t~ret161 := main(); {220393#true} is VALID [2022-04-28 08:52:41,718 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-28 08:52:41,718 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-28 08:52:41,718 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-28 08:52:41,718 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-28 08:52:41,718 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-28 08:52:41,718 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-28 08:52:41,718 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {220393#true} assume !false; {220393#true} is VALID [2022-04-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 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-28 08:52:41,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {220393#true} assume 8464 == #t~mem55;havoc #t~mem55; {220393#true} is VALID [2022-04-28 08:52:41,719 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-28 08:52:41,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {220393#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220393#true} is VALID [2022-04-28 08:52:41,719 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {220393#true} ~skip~0 := 0; {220393#true} is VALID [2022-04-28 08:52:41,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {220393#true} assume !false; {220393#true} is VALID [2022-04-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,720 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-28 08:52:41,721 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-28 08:52:41,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {220393#true} assume 8496 == #t~mem58;havoc #t~mem58; {220393#true} is VALID [2022-04-28 08:52:41,721 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-28 08:52:41,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {220393#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220393#true} is VALID [2022-04-28 08:52:41,721 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-28 08:52:41,721 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-28 08:52:41,722 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-28 08:52:41,723 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-28 08:52:41,723 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-28 08:52:41,723 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-28 08:52:41,723 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-28 08:52:41,724 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-28 08:52:41,724 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-28 08:52:41,724 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-28 08:52:41,725 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-28 08:52:41,725 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-28 08:52:41,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {220394#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {220394#false} is VALID [2022-04-28 08:52:41,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {220394#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {220394#false} is VALID [2022-04-28 08:52:41,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {220394#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {220394#false} is VALID [2022-04-28 08:52:41,725 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-28 08:52:41,725 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-28 08:52:41,725 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {220394#false} ~skip~0 := 0; {220394#false} is VALID [2022-04-28 08:52:41,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 INFO L290 TraceCheckUtils]: 76: Hoare triple {220394#false} assume 8480 == #t~mem52;havoc #t~mem52; {220394#false} is VALID [2022-04-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,726 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-28 08:52:41,727 INFO L290 TraceCheckUtils]: 81: Hoare triple {220394#false} ~skip~0 := 0; {220394#false} is VALID [2022-04-28 08:52:41,727 INFO L290 TraceCheckUtils]: 82: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,727 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 INFO L290 TraceCheckUtils]: 105: Hoare triple {220394#false} assume 8448 == #t~mem68;havoc #t~mem68; {220394#false} is VALID [2022-04-28 08:52:41,728 INFO L290 TraceCheckUtils]: 106: Hoare triple {220394#false} assume !(~num1~0 > 0); {220394#false} is VALID [2022-04-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 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-28 08:52:41,728 INFO L290 TraceCheckUtils]: 110: Hoare triple {220394#false} ~skip~0 := 0; {220394#false} is VALID [2022-04-28 08:52:41,728 INFO L290 TraceCheckUtils]: 111: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,729 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 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-28 08:52:41,730 INFO L290 TraceCheckUtils]: 141: Hoare triple {220394#false} assume 8640 == #t~mem75;havoc #t~mem75; {220394#false} is VALID [2022-04-28 08:52:41,730 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-28 08:52:41,730 INFO L290 TraceCheckUtils]: 143: Hoare triple {220394#false} assume !(9 == ~blastFlag~0); {220394#false} is VALID [2022-04-28 08:52:41,731 INFO L290 TraceCheckUtils]: 144: Hoare triple {220394#false} assume 12 == ~blastFlag~0; {220394#false} is VALID [2022-04-28 08:52:41,731 INFO L290 TraceCheckUtils]: 145: Hoare triple {220394#false} assume !false; {220394#false} is VALID [2022-04-28 08:52:41,731 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-28 08:52:41,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:52:41,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242063465] [2022-04-28 08:52:41,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242063465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:41,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:41,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:41,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:52:41,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91877056] [2022-04-28 08:52:41,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91877056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:41,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:41,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:41,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251629221] [2022-04-28 08:52:41,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:52:41,732 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-28 08:52:41,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:52:41,732 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-28 08:52:41,794 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-28 08:52:41,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:52:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:41,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:52:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:52:41,795 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-28 08:52:43,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:48,601 INFO L93 Difference]: Finished difference Result 2398 states and 3719 transitions. [2022-04-28 08:52:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:48,601 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-28 08:52:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:48,601 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-28 08:52:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-04-28 08:52:48,604 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-28 08:52:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2022-04-28 08:52:48,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 550 transitions. [2022-04-28 08:52:48,945 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-28 08:52:49,022 INFO L225 Difference]: With dead ends: 2398 [2022-04-28 08:52:49,022 INFO L226 Difference]: Without dead ends: 1474 [2022-04-28 08:52:49,023 INFO L412 NwaCegarLoop]: 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-28 08:52:49,023 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 93 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:52:49,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 661 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 592 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 08:52:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-04-28 08:52:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1359. [2022-04-28 08:52:49,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:52:49,124 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-28 08:52:49,124 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-28 08:52:49,125 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-28 08:52:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:49,175 INFO L93 Difference]: Finished difference Result 1474 states and 2273 transitions. [2022-04-28 08:52:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2273 transitions. [2022-04-28 08:52:49,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:49,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:49,177 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-28 08:52:49,178 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-28 08:52:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:49,229 INFO L93 Difference]: Finished difference Result 1474 states and 2273 transitions. [2022-04-28 08:52:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2273 transitions. [2022-04-28 08:52:49,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:49,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:49,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:52:49,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:52:49,230 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-28 08:52:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2119 transitions. [2022-04-28 08:52:49,296 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2119 transitions. Word has length 146 [2022-04-28 08:52:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:52:49,297 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 2119 transitions. [2022-04-28 08:52:49,297 INFO L496 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-28 08:52:49,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2119 transitions. [2022-04-28 08:52:53,758 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-28 08:52:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2119 transitions. [2022-04-28 08:52:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 08:52:53,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:52:53,760 INFO L195 NwaCegarLoop]: 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-28 08:52:53,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 08:52:53,760 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:52:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:52:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2138187216, now seen corresponding path program 1 times [2022-04-28 08:52:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889240775] [2022-04-28 08:52:53,831 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:52:53,831 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:52:53,831 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:52:53,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2138187216, now seen corresponding path program 2 times [2022-04-28 08:52:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:52:53,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517094910] [2022-04-28 08:52:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:52:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:52:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:52:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:53,999 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-28 08:52:53,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {230867#true} assume true; {230867#true} is VALID [2022-04-28 08:52:53,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {230867#true} {230867#true} #710#return; {230867#true} is VALID [2022-04-28 08:52:53,999 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-28 08:52:54,000 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-28 08:52:54,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {230867#true} assume true; {230867#true} is VALID [2022-04-28 08:52:54,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230867#true} {230867#true} #710#return; {230867#true} is VALID [2022-04-28 08:52:54,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {230867#true} call #t~ret161 := main(); {230867#true} is VALID [2022-04-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 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-28 08:52:54,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {230867#true} assume !false; {230867#true} is VALID [2022-04-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {230867#true} assume 8464 == #t~mem55;havoc #t~mem55; {230867#true} is VALID [2022-04-28 08:52:54,001 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-28 08:52:54,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {230867#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {230867#true} is VALID [2022-04-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 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-28 08:52:54,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {230867#true} ~skip~0 := 0; {230867#true} is VALID [2022-04-28 08:52:54,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {230867#true} assume !false; {230867#true} is VALID [2022-04-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 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-28 08:52:54,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {230867#true} assume 8496 == #t~mem58;havoc #t~mem58; {230867#true} is VALID [2022-04-28 08:52:54,002 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-28 08:52:54,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {230867#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {230867#true} is VALID [2022-04-28 08:52:54,003 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-28 08:52:54,003 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-28 08:52:54,004 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-28 08:52:54,004 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-28 08:52:54,005 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-28 08:52:54,005 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-28 08:52:54,005 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-28 08:52:54,006 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-28 08:52:54,006 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-28 08:52:54,006 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-28 08:52:54,006 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-28 08:52:54,007 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-28 08:52:54,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {230868#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {230868#false} is VALID [2022-04-28 08:52:54,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {230868#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {230868#false} is VALID [2022-04-28 08:52:54,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {230868#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {230868#false} is VALID [2022-04-28 08:52:54,007 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-28 08:52:54,007 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-28 08:52:54,007 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-28 08:52:54,007 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-28 08:52:54,007 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-28 08:52:54,007 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-28 08:52:54,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {230868#false} ~skip~0 := 0; {230868#false} is VALID [2022-04-28 08:52:54,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 INFO L290 TraceCheckUtils]: 76: Hoare triple {230868#false} assume 8480 == #t~mem52;havoc #t~mem52; {230868#false} is VALID [2022-04-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {230868#false} ~skip~0 := 0; {230868#false} is VALID [2022-04-28 08:52:54,008 INFO L290 TraceCheckUtils]: 82: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-28 08:52:54,008 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-28 08:52:54,008 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,009 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-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,010 INFO L290 TraceCheckUtils]: 105: Hoare triple {230868#false} assume 8448 == #t~mem68;havoc #t~mem68; {230868#false} is VALID [2022-04-28 08:52:54,010 INFO L290 TraceCheckUtils]: 106: Hoare triple {230868#false} assume !(~num1~0 > 0); {230868#false} is VALID [2022-04-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,010 INFO L290 TraceCheckUtils]: 110: Hoare triple {230868#false} ~skip~0 := 0; {230868#false} is VALID [2022-04-28 08:52:54,010 INFO L290 TraceCheckUtils]: 111: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,010 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,011 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 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-28 08:52:54,012 INFO L290 TraceCheckUtils]: 141: Hoare triple {230868#false} assume 8640 == #t~mem75;havoc #t~mem75; {230868#false} is VALID [2022-04-28 08:52:54,012 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-28 08:52:54,012 INFO L290 TraceCheckUtils]: 143: Hoare triple {230868#false} assume !(9 == ~blastFlag~0); {230868#false} is VALID [2022-04-28 08:52:54,012 INFO L290 TraceCheckUtils]: 144: Hoare triple {230868#false} assume 12 == ~blastFlag~0; {230868#false} is VALID [2022-04-28 08:52:54,012 INFO L290 TraceCheckUtils]: 145: Hoare triple {230868#false} assume !false; {230868#false} is VALID [2022-04-28 08:52:54,013 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-28 08:52:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:52:54,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517094910] [2022-04-28 08:52:54,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517094910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:54,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:54,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:54,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:52:54,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889240775] [2022-04-28 08:52:54,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889240775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:54,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:54,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714101427] [2022-04-28 08:52:54,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:52:54,014 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-28 08:52:54,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:52:54,014 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-28 08:52:54,081 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-28 08:52:54,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:52:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:52:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:52:54,081 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-28 08:52:56,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:59,943 INFO L93 Difference]: Finished difference Result 2494 states and 3842 transitions. [2022-04-28 08:52:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:59,943 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-28 08:52:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:59,943 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-28 08:52:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-28 08:52:59,945 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-28 08:52:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-28 08:52:59,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 605 transitions. [2022-04-28 08:53:00,344 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-28 08:53:00,443 INFO L225 Difference]: With dead ends: 2494 [2022-04-28 08:53:00,443 INFO L226 Difference]: Without dead ends: 1570 [2022-04-28 08:53:00,444 INFO L412 NwaCegarLoop]: 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-28 08:53:00,444 INFO L413 NwaCegarLoop]: 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-28 08:53:00,444 INFO L414 NwaCegarLoop]: 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-28 08:53:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-04-28 08:53:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1359. [2022-04-28 08:53:00,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:53:00,550 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-28 08:53:00,551 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-28 08:53:00,552 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-28 08:53:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:00,615 INFO L93 Difference]: Finished difference Result 1570 states and 2377 transitions. [2022-04-28 08:53:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2377 transitions. [2022-04-28 08:53:00,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:00,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:00,617 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-28 08:53:00,618 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-28 08:53:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:00,681 INFO L93 Difference]: Finished difference Result 1570 states and 2377 transitions. [2022-04-28 08:53:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2377 transitions. [2022-04-28 08:53:00,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:00,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:00,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:53:00,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:53:00,682 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-28 08:53:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2095 transitions. [2022-04-28 08:53:00,748 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2095 transitions. Word has length 146 [2022-04-28 08:53:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:53:00,748 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 2095 transitions. [2022-04-28 08:53:00,748 INFO L496 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-28 08:53:00,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1359 states and 2095 transitions. [2022-04-28 08:53:05,215 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-28 08:53:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2095 transitions. [2022-04-28 08:53:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 08:53:05,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:53:05,217 INFO L195 NwaCegarLoop]: 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-28 08:53:05,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 08:53:05,219 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:53:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:53:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1315650067, now seen corresponding path program 1 times [2022-04-28 08:53:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1891722215] [2022-04-28 08:53:05,527 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-28 08:53:05,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:53:05,527 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:53:05,528 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:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 08:53:05,532 INFO L158 Benchmark]: Toolchain (without parser) took 566843.37ms. Allocated memory was 200.3MB in the beginning and 289.4MB in the end (delta: 89.1MB). Free memory was 178.3MB in the beginning and 229.8MB in the end (delta: -51.5MB). Peak memory consumption was 192.6MB. Max. memory is 8.0GB. [2022-04-28 08:53:05,533 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:53:05,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.82ms. Allocated memory is still 200.3MB. Free memory was 178.1MB in the beginning and 151.6MB in the end (delta: 26.5MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2022-04-28 08:53:05,533 INFO L158 Benchmark]: Boogie Preprocessor took 85.27ms. Allocated memory is still 200.3MB. Free memory was 151.6MB in the beginning and 141.4MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:53:05,533 INFO L158 Benchmark]: RCFGBuilder took 1360.85ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 141.4MB in the beginning and 147.7MB in the end (delta: -6.3MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2022-04-28 08:53:05,533 INFO L158 Benchmark]: TraceAbstraction took 564953.18ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 147.2MB in the beginning and 229.8MB in the end (delta: -82.6MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-04-28 08:53:05,533 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.10ms. Allocated memory is still 200.3MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.82ms. Allocated memory is still 200.3MB. Free memory was 178.1MB in the beginning and 151.6MB in the end (delta: 26.5MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.27ms. Allocated memory is still 200.3MB. Free memory was 151.6MB in the beginning and 141.4MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1360.85ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 141.4MB in the beginning and 147.7MB in the end (delta: -6.3MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. * TraceAbstraction took 564953.18ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 147.2MB in the beginning and 229.8MB in the end (delta: -82.6MB). Peak memory consumption was 120.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-28 08:53:05,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...